B'You are given a simple undirected graph with n nodes and m edges. Note that the graph is not necessarily connected. The nodes are labeled from 1 to n . We define a graph to be a Fish Graph if it contains a simple cycle with a special node u belonging to the cycle. Apart from the edges in the cycle, the graph should have exactly 2 extra edges. Both edges should connect to node u , but they should not be connected to any other node of the cycle. Determine if the graph contains a subgraph that is a Fish Graph, and if so, find any such subgraph. In this problem, we define a subgraph as a graph obtained by taking any subset of the edges of the original graph. The first line of input contains the integer t ( 1 <= q t <= q 1000 ), the number of test cases. The description of test cases follows. The first line of each test case contains two integers, n and m ( 1 <= n, m <= 2 ,000 ) -- the number of nodes and the number of edges. Each of the next m lines contains the description of an edge. Each line contains two integers u_i and v_i ( 1 <= q u_i, v_i <= q n , u_i neq v_i ) -- an edge connects node u_i to node v_i . It is guaranteed that no two edges connect the same unordered pair of nodes. Furthermore, it is guaranteed that the sum of n and the sum of m over all test cases both do not exceed 2 ,000 . For each testcase, output "YES" if the graph contains a subgraph that is a Fish Graph, otherwise print "NO". If the answer is "YES", on the following lines output a description of the subgraph. The first line of the description contains one integer k -- the number of edges of the subgraph. On the next k lines, output the edges of the chosen subgraph. Each of the k lines should contains two integers u and v ( 1 <= u, v <= n , u neq v ) -- the edge between u and v belongs to the subgraph. T'...