The Albanian students, who have been studying for the Olympiads in Informatics, gather around in the school and study on new topics. They have been practicing by typing codes for the Olympiad competitions.

A prominent member of the community is the hardworking student, Ali abi. Every evening, if Ali is present, he teaches a brand new Olympiad subject that no other student has heard before, and no other topic is thought that night. In the event that Ali is not present, other students learn without him and exchange (teach each other) all knowledge (topics) that they know.

Question: Given the list of students present for D consecutive camp days, output all students that know all topics learned during that period.

Input specification: The first line of input contains an integer N, 1 <= N <= 100, the number of students. The students are numbered 1 to N. Student number 1 is Ali. The second line contains an integer D, 1 <= D <= 50, the number of camp days. The next D lines contain the list of students present on each of the D days. Each line begins with a positive integer K, 2 <= K <= N, the number of students present that day, followed by K positive integers separated by spaces representing the students. No student will appear twice in one day and Ali will appear at least once across all nights.

Output specification:
Output all students that know all topics, including Ali, one integer per line in ascending order.