Bard#772
Every evening, the residents of a small village gather around a large bonfire and sing songs. Among them lives a prominent bard. Every evening, if the bard is present at the gathering, he performs a new song that no villager has ever heard before. On that evening, no other songs are sung.
If the bard is absent from the gathering, then all other present villagers sing and share all the songs they know with each other.
Given the lists of the villagers present at each of the consecutive evenings, output the list of villagers who know all the songs performed during that period.
The first line of input contains an integer (1 \leq N \leq 100) — the number of villagers in the village. Villager number is the bard.
The second line contains an integer (1 \leq E \leq 50) — the number of evenings.
The next lines each contain the numbers of the villagers present at each of the evenings. Each line starts with an integer (2 \leq K \leq N) — the number of villagers present that evening, followed by positive integers separated by spaces, representing the numbers of the villagers present. No villager's number appears twice in the same evening. The bard is present on at least one evening.
Output the numbers of all villagers, including the bard, who know all the songs. Output the numbers in ascending order, one number per line. The output of the last number should also be followed by a line break.
Example 1