Problem G
Pick up sticks

Pick up sticks is a fascinating game. A collection of coloured sticks are dumped in a tangled heap on the table. Players take turns trying to pick up a single stick at a time without moving any of the other sticks. It is very difficult to pick up a stick if there is another stick lying on top of it. The players therefore try to pick up the sticks in an order such that they never have to pick up a stick from underneath another stick.

Input

The first line contains two integers $n$ and $m$ each at least one and no greater than one million. The integer $n$ is the number of sticks, and $m$ is the number of lines that follow. The sticks are numbered from 1 to $n$. Each of the following lines contains a pair of integers $a$, $b$, indicating that there is a point where stick $a$ lies on top of stick $b$.

Output

Output $n$ lines of integers, listing the sticks in the order in which they could be picked up without ever picking up a stick with another stick on top of it. If there are multiple such correct orders, any one will do. If there is no such correct order, output a single line containing the word IMPOSSIBLE.

3 2
1 2
2 3

1
2
3