Strange Housing

给定一个 $n$ 个节点，$m$ 条无向边的图，现在你要给一些点染色，使得： - 一条边所连接的两个点不能都被染色。 - 在所有连接两个不被染色的点的边都被删除的情况下，这个图满足任意两个点互相可达。 如果有染色方案满足上述要求，输出一行 `YES` 之后输出要染色的点的数量，并以任意顺序输出所有被染色的点的编号;否则输出一行 `NO`。 $T$ 组询问。 $1\leq T\leq 10^5;2\leq n\leq 3\times10^5;0\leq m\leq 3\times10^5.$ $\sum n,\sum m\leq 3\times10^5.$

Students of Winter Informatics School are going to live in a set of houses connected by underground passages. Teachers are also going to live in some of these houses, but they can not be accommodated randomly. For safety reasons, the following must hold: - All passages between two houses will be closed, if there are no teachers in both of them. All other passages will stay open. - It should be possible to travel between any two houses using the underground passages that are open. - Teachers should not live in houses, directly connected by a passage. Please help the organizers to choose the houses where teachers will live to satisfy the safety requirements or determine that it is impossible.

The first input line contains a single integer $ t $ — the number of test cases ( $ 1 \le t \le 10^5 $ ). Each test case starts with two integers $ n $ and $ m $ ( $ 2 \le n \le 3 \cdot 10^5 $ , $ 0 \le m \le 3 \cdot 10^5 $ ) — the number of houses and the number of passages. Then $ m $ lines follow, each of them contains two integers $ u $ and $ v $ ( $ 1 \le u, v \le n $ , $ u \neq v $ ), describing a passage between the houses $ u $ and $ v $ . It is guaranteed that there are no two passages connecting the same pair of houses. The sum of values $ n $ over all test cases does not exceed $ 3 \cdot 10^5 $ , and the sum of values $ m $ over all test cases does not exceed $ 3 \cdot 10^5 $ .

For each test case, if there is no way to choose the desired set of houses, output "NO". Otherwise, output "YES", then the total number of houses chosen, and then the indices of the chosen houses in arbitrary order.

2
3 2
3 2
2 1
4 2
1 4
2 3

YES
2
1 3 
NO

1
17 27
1 8
2 9
3 10
4 11
5 12
6 13
7 14
8 9
8 14
8 15
9 10
9 15
10 11
10 15
10 17
11 12
11 17
12 13
12 16
12 17
13 14
13 16
14 16
14 15
15 16
15 17
16 17

YES
8
1 3 4 5 6 9 14 17

The picture below shows the second example test.