Problem

You are given an integer sequence $A = (A_{1}, A_{2}, \dots, A_{N})$ of length $N$ and an integer sequence $B = (B_{1}, B_{2}, \dots, B_{M})$ of length $M$. Output all integers that appear in both $A$ and $B$, $1$ of each, in ascending order.

Constraints

• $1 \le N \le 100$.
• $1 \le M \le 100$.
• $1 \le A_{i} \le 100$ ($1 \le i \le N$).
• $1 \le B_{j} \le 100$ ($1 \le j \le M$).

Input

The input is given from Standard Input in the following format:

N M
A_1 A_2 ... A_N
B_1 B_2 ... B_M

Output

Output all integers that appear in both $A$ and $B$, $1$ of each, in ascending order. Separate the integers by newlines.

Sample Input and Output

Sample Input 1

6 5
2 4 6 8 10 12
15 12 9 6 3

Sample Output 1

6
12

• $6$ appears as the $3$-rd element of $A$ and the $4$-th element of $B$. Also, $12$ appears as the $6$-th element of $A$ and the $2$-nd element of $B$. There is no integer other than $6$ and $12$ that appears in both $A, B$. Therefore, output $6, 12$ in ascending order separated by newlines.

Sample Input 2

3 5
100 100 100
100 100 100 100 100

Sample Output 2

100

• $100$ appears in both $A, B$. There is no integer other than $100$ that appears in $A, B$. Therefore, output $100$.

Sample Input 3

1 1
2
5

Sample Output 3

```

- There is no integer that appears in both $A, B$. Therefore, output nothing.

---

#### Sample Input 4

10 10 76 91 98 7 98 7 98 10 63 91 70 71 10 10 91 70 65 10 63 76

#### Sample Output 4

10 63 76 91 ```