Find Permutation#11461
There is a length sequence A = (a_1, a_2, ..., a_n) that is a permutation of 1, 2, ..., n.
While you do not know , you know that A_{x_i} < A_{y_i} for pairs of integers (x_i, y_i).
Can be uniquely determined? If it is possible, find .
The first line contains two numbers n\:(2 \le n \le 2 \cdot 10^5) and m\:(1 \le m \le 2 \cdot 10^5).
Each of the next lines contains a pair of integers (x_i, y_i), 1 \le x_i, y_i \le n.
If can be uniquely determined, print Yes in the first line. Then, print a_1, a_2, ..., a_n in the second line.
If cannot be uniquely determined, just print No.
Example 1
Example 2