영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You want to complete n courses that have requirements of the form "course a has to be completed before course b".
You want to complete course 1 as soon as possible. If there are several ways to do this, you want then to complete course 2 as soon as possible, and so on.
Your task is to determine the order in which you complete the courses.
Input
The first input line has two integers n and m: the number of courses and requirements. The courses are numbered 1,2,…,n.
Then, there are m lines describing the requirements. Each line has two integers a and b: course a has to be completed before course b.
You can assume that there is at least one valid schedule.
Output
Print one line having n integers: the order in which you complete the courses.
Constraints
- 1 ≤ n ≤ 10^5
- 1 ≤ m ≤ 2 · 10^5
- 1 ≤ a,b ≤ n
예제
예제 1
4 2 2 1 2 3
2 1 3 4