AT_past202303_l 順位表

There are $ N $ players numbered $ 1,2,\dots $ , and $ N $ . These $ N $ players are playing the same game. In this game, two players play a match against each other. The $ N $ players have distinct strengths; the player with the greater strength always wins a match. There were $ M $ matches. The $ i $ -th match was between players $ A_i $ and $ B_i $ , and player $ A_i $ won. Find the lexicographically smallest possible sequence of the $ N $ players sorted by their strengths in descending order.

The input is given from Standard Input in the following format: > $ N $ $ M $ $ A_1 $ $ B_1 $ $ A_2 $ $ B_2 $ $ \vdots $ $ A_M $ $ B_M $

Find the lexicographically smallest possible sequence of the $ N $ players sorted by their strengths in descending order, separated by spaces.

### Sample Explanation 1 $ (2,3,1) $ , $ (3,1,2) $ , and $ (3,2,1) $ are the possible sequences of the $ N $ players sorted by their strengths in descending order that satisfy the conditions. The answer is $ (2,3,1) $ , which is the lexicographically smallest one among them. ### Constraints - $ 2 \le N \le 2 \times 10^5 $ - $ 0 \le M \le 2 \times 10^5 $ - $ 1 \le A_i,B_i \le N $ - $ A_i \neq B_i $ - All values in the input are integers. - The $ M $ conditions are consistent.