Three vault terminals in a secure facility each keep an independent access log for a single day. Every time a technician badges in, the terminal appends that access code to its own log, so each terminal's log lists codes in strictly increasing numeric order with no repeats (a code used earlier in the day is numerically smaller than one used later). Security wants to know exactly which access codes were presented at all three terminals on that day, listed from smallest to largest.

Input format

• Line 1: a single integer n1, the length of terminal A's log.
• Line 2: n1 integers, terminal A's log, strictly increasing.
• Line 3: a single integer n2, the length of terminal B's log.
• Line 4: n2 integers, terminal B's log, strictly increasing.
• Line 5: a single integer n3, the length of terminal C's log.
• Line 6: n3 integers, terminal C's log, strictly increasing.

Output format

Print the access codes that appear in all three logs, in increasing order, separated by single spaces on one line. If no code appears in all three logs, print an empty line.

Constraints

• 1 <= n1, n2, n3 <= 1000
• -10^9 <= code <= 10^9
• Within each single log, all codes are distinct and given in strictly increasing order.

4
1 2 3 5
5
1 2 5 7 9
5
1 3 4 5 8

1 5

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

(empty)