PROGRAMMING:Handsome enough to have no friends
When people are busy sending photos in their circle of friends, there are always some people who are too handsome to have friends. This problem requires you to find out those handsome people who have no friends.
###Input format:
Enter the first line to give a positive integer 'n' ($$$Le 100 $$), which is the number of known circle of friends; Next, the 'n' line gives a positive integer 'k' ($$$Le 1000 $$) for each line, which is the number of people in the circle of friends, and then lists all people in the circle of friends. For convenience, each person corresponds to an ID number, which is 5 digits (from 00000 to 99999), and the IDs are separated by spaces; After that, a positive integer'm '($$$Le 10000 $$) is given, which is the number of people to be queried; The next line lists'm 'IDs to be queried, separated by spaces.
Note: people who don't have friends can be people who don't have a "circle of friends" at all, or they can be people who only have themselves in the circle of friends. Although some narcissists will add themselves to their circle of friends repeatedly, the topic ensures that all the circle of friends with a "K" of more than 1 have at least two different people.
###Output format:
Output those who are so handsome that they have no friends in the order of input. IDS should be separated by one space, and there should be no extra space at the beginning and end of the line. If no one is too handsome, output 'no one is handsome'.
Note: the same person can be queried multiple times, but only output once.
###Input sample 1:
```in
three
3 11111 22222 55555
2 33333 44444
4 55555 66666 99999 77777
eight
55555 44444 10000 88888 22222 11111 23333 88888
```
###Output sample 1:
```out
10000 88888 23333
```
###Input example 2:
```
three
3 11111 22222 55555
2 33333 44444
4 55555 66666 99999 77777
four
55555 44444 22222 11111
```
###Output example 2:
```
No one is handsome
```
answer：If there is no answer, please comment
###Input format:
Enter the first line to give a positive integer 'n' ($$$Le 100 $$), which is the number of known circle of friends; Next, the 'n' line gives a positive integer 'k' ($$$Le 1000 $$) for each line, which is the number of people in the circle of friends, and then lists all people in the circle of friends. For convenience, each person corresponds to an ID number, which is 5 digits (from 00000 to 99999), and the IDs are separated by spaces; After that, a positive integer'm '($$$Le 10000 $$) is given, which is the number of people to be queried; The next line lists'm 'IDs to be queried, separated by spaces.
Note: people who don't have friends can be people who don't have a "circle of friends" at all, or they can be people who only have themselves in the circle of friends. Although some narcissists will add themselves to their circle of friends repeatedly, the topic ensures that all the circle of friends with a "K" of more than 1 have at least two different people.
###Output format:
Output those who are so handsome that they have no friends in the order of input. IDS should be separated by one space, and there should be no extra space at the beginning and end of the line. If no one is too handsome, output 'no one is handsome'.
Note: the same person can be queried multiple times, but only output once.
###Input sample 1:
```in
three
3 11111 22222 55555
2 33333 44444
4 55555 66666 99999 77777
eight
55555 44444 10000 88888 22222 11111 23333 88888
```
###Output sample 1:
```out
10000 88888 23333
```
###Input example 2:
```
three
3 11111 22222 55555
2 33333 44444
4 55555 66666 99999 77777
four
55555 44444 22222 11111
```
###Output example 2:
```
No one is handsome
```
answer：If there is no answer, please comment