|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||11||10||10||90.909%|
As a Swede, you hold a deep love for the traditional Thursday lunch of pea soup and pancakes. You love it so much, in fact, that you will eat it any meal it is available. You find yourself looking at the menus for all your favorite restaurants every day to see if this combination is available, and realized you can do this more easily with a program. Given a list of restaurant menus, decide where to eat.
The first line of input contains a number n (1 ≤ n ≤ 10), the number of restaurants. Then follow the n restaurant menus. Each menu starts with a line containing a number k (1 ≤ k ≤ 10), the number of menu items for the day. The remainder of the menu consists of k + 1 lines, each containing a nonempty string of at most 100 characters. The first of these lines is the restaurant name, and the rest are menu items. Strings consist only of lower case letters ‘a’-‘z’ and spaces, and they always start and end with a letter. All restaurant names are unique.
Output a single line. If at least one restaurant has both “pea soup” and “pancakes” as menu items, output the name of the first of those restaurants, by the order in which the restaurants appear in the input. Otherwise, output “Anywhere is fine I guess”.
2 2 q potatoes salad 3 nymble pancakes pea soup punsch
4 2 asian wok house paa soup pancakes 2 kebab kitchen pea soup pancakes 2 la campus tasty pea soup pancakes 3 slime stand slime pea soup and pancakes slime
Anywhere is fine I guess