There is a length n sequence A=(a1,a2,...,an) that is a permutation of 1,2,...,n.
While you do not know A, you know that Axi<Ayi for m pairs of integers (xi,yi).
Can A be uniquely determined? If it is possible, find A.
The first line contains two numbers n(2≤n≤2⋅105) and m(1≤m≤2⋅105).
Each of the next m lines contains a pair of integers (xi,yi), 1≤xi,yi≤n.
If A can be uniquely determined, print Yes in the first line. Then, print a1,a2,...,an in the second line.
If A cannot be uniquely determined, just print No.