A multi-stage festival has several entry stations, and each station independently scans and records the wristband ID of every attendee who passes through it during the day; within a single station's log, IDs never repeat. Festival organizers want to open an exclusive after-party to every attendee whose wristband was scanned at every single station — meaning that ID must appear in all of the stations' logs.

Given the logs from all stations, list every wristband ID that appears in all of them, sorted in ascending order.

Input format

Line 1: a single integer M — the number of stations. Each of the next M lines describes one station's log: an integer k (the number of IDs scanned at that station) followed by k space-separated distinct positive integers — the wristband IDs scanned at that station (not necessarily given in sorted order).

Output format

A single line with every wristband ID that appears in all M stations' logs, in ascending order, space-separated. If no such ID exists, print an empty line.

Constraints

• 1 <= M <= 1000
• 1 <= k <= 1000 for each station, and the sum of k over all stations is at most 2000
• 1 <= wristband ID <= 1000
• Within a single station's log, all IDs are distinct.

3
5 3 1 2 4 5
4 1 2 3 4
4 3 4 5 6

3 4

2
3 1 2 3
3 4 5 6

(empty)