Description

The Kingdom of Topcaria is planning a series of developmental projects to enhance its infrastructure. Each project has specific prerequisites that must be completed before the project can start. The Ministry of Development has asked you to help determine a feasible order in which all the projects can be completed.

You are given:

• $n$, the number of projects numbered from $1$ to $n$.
• $m$, the number of prerequisite relationships between these projects.
• A list of $m$ pairs, where each pair $(a, b)$ indicates that project $a$ must be completed before project $b$ can start.

Your task is to determine an order in which all the projects can be completed. If it is impossible to complete all projects due to a cyclic dependency, output “IMPOSSIBLE”. If there are multiple valid orders, please output any the lexicographically smallest one.

Input Format

The first line contains two integers $n$ and $m$ — the number of projects and the number of prerequisite relationships. The next $m$ lines each contain two integers $a$ and $b$ — a prerequisite pair indicating that project $a$ must be completed before project $b$.

Output Format

If it is not possible, output “IMPOSSIBLE”. If it is possible to complete all projects, output a single line with $n$ integers — a valid order of project completions. If there are multiple possible orders, output the lexicographically smallest one. An order is lexicographically smaller than another order if at the first position where they differ, the project number on the first order is smaller than the number on the second order.

5 5
1 2
2 3
2 4
2 5
3 4

1 2 3 4 5

5 4
1 2
2 3
3 1
5 4

IMPOSSIBLE

Hint

• $1 \le n \le 10^5$
• $0 \le m \le 2 \times 10^5$
• $a, b \in \{1, 2, \dots, n\}$
• $a \ne b$
• No duplicate pairs are given.