PivotOJ

Haughty Cuisine

시간 제한: 1000ms메모리 제한: 512MB출처: BAPC 2020BOJ 20336

문제

As a waiter, your favourite question from an indecisive punter is "I'm not sure, what would you recommend?" --- so much so, in fact, that you decided to automate away the answer to avoid having to spend any brain cycles on this question ever again.

You have the list of all set menus for today and you are going to simply pick one at random. As long as your recommendation corresponds to a list of items on a set menu, everything will be fine.

입력

  • One line containing a single integer 1n1001\leq n\leq 100, the number of set menus.
  • nn lines, one for each menu. Each of these lines contains a single integer 1d421\leq d\leq 42, followed by a list of dd dishes that the meal consists of.

Each dish is described using at most 2020 lowercase Latin characters.

출력

Output one line containing mm, the number of dishes that you recommend, followed by mm 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
garlicbread
pizza

예제 2

입력
4
2 pasta pizza
3 icecream sweets pasta
1 megapizza
2 icecream pizza
출력
3
pasta
icecream
sweets
이 문제는 채점 준비 중입니다. 테스트 데이터가 확보되면 제출이 가능합니다.