TOPOSORT - Topological Sorting

Sandro is a well organised person. Every day he makes a list of things which need to be done and enumerates them from 1 to n. However, some things need to be done before others. In this task you have to find out whether Sandro can solve all his duties and if so, print the correct order.

Input

In the first line you are given an integer n and m (1 <= n <= 10000, 1 <= m <= 1000000). On the next m lines there are two distinct integers x and y, (1 <= x, y <= 10000) describing that job x needs to be done before job y.

Output

Print "Sandro fails." if Sandro cannot complete all his duties on the list. If there is a solution print the correct ordering, the jobs to be done separated by a space. If there are multiple solutions print the one, whose first number is smallest, if there are still multiple solutions, print the one whose second number is smallest, and so on.

Example 1

Input:
8 9
1 4
1 2
4 2
4 3
3 2
5 2
3 5
8 2
8 6

Output:
1 4 3 5 7 8 2 6 

Example 2

Input:
2 2
1 2
2 1

Output:
Sandro fails.

Added by:Josef Ziegler
Date:2011-10-23
Time limit:0.5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All

hide comments
2024-01-22 20:23:43
kahn's algo
2023-08-25 22:41:34
It is "Sandro" and not "Sandra"
2023-05-23 18:46:13
What a bad checker this problem has, it's just so painful
2023-04-29 07:38:02
suck it up
2023-04-25 11:28:53
SHAZAMMMM!
2022-07-20 11:35:44
Don't forget the dots :)))
2022-05-16 14:37:29
AC code: <snip>
[Simes]: No thanks, we don't want links to code.


Last edit: 2022-05-31 18:45:17
2022-04-18 15:01:20
+1, to put full stop in Sandro fails.
2021-11-29 10:09:21
anyone help me? i can not understand why my code is wrong https://ideone.com/<snip>

[Francky] => Please read the footer and use the forum.

Last edit: 2021-11-29 15:54:59
2021-11-28 10:59:00
Don't forget to put full stop right after Sandro fails => Sandro fails.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.