# Find a cycle

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

The directed and unweighted graph is given. Determine, does it contain a cycle. If yes, then print any of them.

## Input

The first line contains two positive integers $n$ and $m(1≤n≤10_{5},1≤m≤10_{5})$ — the number of vertices and edges in graph respectively. In the next $m$ lines the edges are given. Each edge is described with a pair of numbers — the numbers of initial and final vertex respectively.

## Output

If the graph does not contain the cycle, print "NO", otherwise print "YES" and then the list of vertices in the order of cycle traversal.

## Examples

Input #1

Answer #1

Input #2

Answer #2

Submissions 9K

Acceptance rate 27%