Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she has started to work on a still-life «interesting graph and apples». An undirected graph is called interesting, if each of its vertices belongs to one cycle only — a funny ring — and does not belong to any other cycles. A funny ring is a cycle that goes through all the vertices just once. Moreover, loops are funny rings too. She has already drawn the apples and some of the graph edges. But now it is not clear, how to connect the rest of the vertices to get an interesting graph as a result. The answer should contain the minimal amount of added edges. And furthermore, the answer should be the lexicographically smallest one. The set of edges ( x 1 , y 1 ), ( x 2 , y 2 ), ..., ( x n , y n ) , where x i ≤ y i , is lexicographically smaller than the set ( u 1 , v 1 ), ( u 2 , v 2 ), ..., ( u n , v n ) , where u i ≤ v i , provided that the sequence of integers x 1 , y 1 , x 2 , y 2 , ..., x n , y n is lexicographically smaller than the sequence u 1 , v 1 , u 2 , v 2 , ..., u n , v n . If you do not cope, Hexadecimal will eat you. ...eat you alive. The first line of the input data contains a pair of integers n and m ( 1 ≤ n ≤ 50 , 0 ≤ m ≤ 2500 ) — the amount of vertices and edges respectively. The following lines contain pairs of numbers x i and y i ( 1 ≤ x i , y i ≤ n ) — the vertices that are already connected by edges. The initial graph may contain multiple edges and loops. In the first line output « YES » or « NO »: if it is possible or not to construct an interesting graph. If the answer is « YES », in the second line output k — the amount of edges that should be added to the initial graph. Finally, output k lines: pairs of vertices x j and y j , between which edges should be drawn. The result may contain multiple edges and loops. k can be equal to zero.