Police is running after a thief. They think that the thief is trying to hide himself and very few people know him. Possible candidates are known in the region by less than a number given (k).

Question: Write a program that will read list of people and a list of friendship relations. Then, the program lists possible candidates which are known by less than k people.

Input specification: In the beginning, you will be given two integers: number of people (n), and maximum number of friends (k). Next n lines give the list of people. Following line has an integer (m) number of connections. Each of next m lines contains two names who know each other. Names are at most 20 chars containing only 26 uppercase or lowercase English letters; 1 ≤ k ≤ n ≤ 5,000 and 1 ≤ m ≤ 30,000. Note that a person cannot be the friend of himself. As in the example Jonara knows herself too, but this is not count as another person.

Output specification: First show the number of possible candidates. Then, show the list of people in each line. The order of names is not important. You can print names in any order.