영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
A game has n levels and m teleporters between them. You win the game if you move from level 1 to level n using every teleporter exactly once.
Can you win the game, and what is a possible way to do it?
Input
The first input line has two integers n and m: the number of levels and teleporters. The levels are numbered 1,2,…,n.
Then, there are m lines describing the teleporters. Each line has two integers a and b: there is a teleporter from level a to level b.
You can assume that each pair (a,b) in the input is distinct.
Output
Print m+1 integers: the sequence in which you visit the levels during the game. You can print any valid solution.
If there are no solutions, print "IMPOSSIBLE".
Constraints
- 2 ≤ n ≤ 10^5
- 1 ≤ m ≤ 2 · 10^5
- 1 ≤ a,b ≤ n
예제
예제 1
5 6 1 2 1 3 2 4 2 5 3 1 4 2
1 3 1 2 4 2 5