PROGRAMMING:divide and rule
Divide and rule, and break each one is one of the strategies commonly used by military strategists. In the war, we hope to capture some of the enemy's cities first, and make the remaining cities helpless, and then break them up separately. To this end, the general staff has provided several strike plans. Please write a program to judge the feasibility of each scheme.
###Input format:
Enter two positive integers n and m (no more than 10 000) in the first line, which are the number of enemy cities (so the default cities are numbered from 1 to n) and the number of access roads connecting the two cities. Then m lines, each line gives the number of the two cities connected by a road, separated by a space. After the city information, a series of schemes of the general staff are given, that is, a positive integer k ($$$Le $$100) and the subsequent K-line scheme. Each line is given in the following format:
```
Np v[1] v[2] ... v[Np]
```
Among them, 'NP' is the number of cities planned to be captured in the scheme, and the following series' v [i] 'is the number of cities planned to be captured.
###Output format:
For each scheme, if it is feasible, output "yes"; otherwise, output "no".
###Input example:
```in
10 11
8 7
6 8
4 5
8 4
8 1
1 2
1 4
9 8
9 1
1 10
2 4
five
4 10 3 8 4
6 6 1 7 5 4 9
3 1 8 4
2 2 8
7 9 8 7 6 5 4 2
```
###Output example:
```out
NO
YES
YES
NO
NO
```
answer：If there is no answer, please comment
###Input format:
Enter two positive integers n and m (no more than 10 000) in the first line, which are the number of enemy cities (so the default cities are numbered from 1 to n) and the number of access roads connecting the two cities. Then m lines, each line gives the number of the two cities connected by a road, separated by a space. After the city information, a series of schemes of the general staff are given, that is, a positive integer k ($$$Le $$100) and the subsequent K-line scheme. Each line is given in the following format:
```
Np v[1] v[2] ... v[Np]
```
Among them, 'NP' is the number of cities planned to be captured in the scheme, and the following series' v [i] 'is the number of cities planned to be captured.
###Output format:
For each scheme, if it is feasible, output "yes"; otherwise, output "no".
###Input example:
```in
10 11
8 7
6 8
4 5
8 4
8 1
1 2
1 4
9 8
9 1
1 10
2 4
five
4 10 3 8 4
6 6 1 7 5 4 9
3 1 8 4
2 2 8
7 9 8 7 6 5 4 2
```
###Output example:
```out
NO
YES
YES
NO
NO
```
answer：If there is no answer, please comment