#D12636. Set Intersection

    ID: 10508 Type: Default 2000ms 268MiB

Set Intersection

Set Intersection

Find the intersection of two sets A=a0,a1,...,an1A = \\{a_0, a_1, ..., a_{n-1}\\} and B=b0,b1,...,bm1B = \\{b_0, b_1, ..., b_{m-1}\\}.

Constraints

  • 1n,m200,0001 \leq n, m \leq 200,000
  • 0a0<a1<...<an11090 \leq a_0 < a_1 < ... < a_{n-1} \leq 10^9
  • 0b0<b1<...<bm11090 \leq b_0 < b_1 < ... < b_{m-1} \leq 10^9

Input

The input is given in the following format.

nn a0  a1  ...  an1a_0 \; a_1 \; ... \; a_{n-1} mm b0  b1  ...  bm1b_0 \; b_1 \; ... \; b_{m-1}

Elements of AA and BB are given in ascending order respectively. There are no duplicate elements in each set.

Output

Print elements in the intersection in ascending order. Print an element in a line.

Example

Input

4 1 2 5 8 5 2 3 5 9 11

Output

2 5

inputFormat

Input

The input is given in the following format.

nn a0  a1  ...  an1a_0 \; a_1 \; ... \; a_{n-1} mm b0  b1  ...  bm1b_0 \; b_1 \; ... \; b_{m-1}

Elements of AA and BB are given in ascending order respectively. There are no duplicate elements in each set.

outputFormat

Output

Print elements in the intersection in ascending order. Print an element in a line.

Example

Input

4 1 2 5 8 5 2 3 5 9 11

Output

2 5

样例

4
1 2 5 8
5
2 3 5 9 11
2

5

</p>