PROGRAMMING:Finding the intersection of sets
Find the intersection of integer set a and integer set B.
###Input format:
There are three lines of input:
The first line is the number of elements m and N of a and B (m, n < = 100);
The second line is the m elements of set a;
The third line is the n elements of set a.
###Output format:
Output all elements of the intersection (output in the order in which they appear in set a, with no space after the last output).
If the intersection is empty, output "null".
###Input example:
Here is a set of inputs. For example:
```in
3 4
10 9 2
9 10 8 0
```
###Output example:
The corresponding output is given here. For example:
```out
10 9
```
answer：If there is no answer, please comment
###Input format:
There are three lines of input:
The first line is the number of elements m and N of a and B (m, n < = 100);
The second line is the m elements of set a;
The third line is the n elements of set a.
###Output format:
Output all elements of the intersection (output in the order in which they appear in set a, with no space after the last output).
If the intersection is empty, output "null".
###Input example:
Here is a set of inputs. For example:
```in
3 4
10 9 2
9 10 8 0
```
###Output example:
The corresponding output is given here. For example:
```out
10 9
```
answer：If there is no answer, please comment