DK-GEORGMOHR 2007 Problem 3

A cunning dragon guards a princess. To overcome the dragon and to win the princess you must solve the following task: The dragon has in some of the fields $i$ the columned hall (see figure) with the numbers $1-8$ . Even in the rest of the fields you can place numbers $9-36$ . The numbers $1-36$ must be arranged so that any turn that starts with one enters from either the south or the west, and ends up going out towards either the north or east, goes through at least one number from the $5$ table. (On the figure are north, south, east and west indicated by N, S, E and W). Georg wants to win the princess. Is it possible to be done?