Henk is hungry. He has not eaten anything in the past 42 minutes. His belly is rumbling and he is craving some good food. Luckily for Henk, this is not the fifirst time that he is hungry, so he knows exactly which combinations of dishes can make his belly feel full again. Henk, along with many others,calls these combinations of dishes meals. Unfortunately, Henk is very indecisive, so he wants somebody else to make a choice for him. He hands you a list of meals of which he knows that they will make his belly full, and asks you to recommend him exactly one complete meal from this list.
输入描述:
The input consists of:
• One line containing a single integer 1 ≤ n ≤ 100, the number of meals.
• n lines, one for each meal. Each of these lines contains a single integer 1 ≤ d ≤ 42,followed by a list of d dishes that the meal consists of.
Each dish is described using at most 20 lowercase English characters.
输出描述:
Output one line containing m, the number of dishes that you recommend, followed by m lines,containing the dishes you recommend.
If there are multiple possible solutions, you may output any one of them.
示例1
输入
复制
3
2 bigburger fries
2 pizza garlicbread
2 macaroni cheese
示例2
输入
复制
4
2 pasta pizza
3 icecream sweets pasta
1 megapizza
2 icecream pizza