PROGRAMMING:Or the intersection of sets
Given two sets of integers (no duplicate elements in each set), the number of set elements is less than or equal to 100000, the intersection of two sets is calculated and output in non descending order.
###Input format:
The first line is n and m, representing the number of elements of the two sets;
Then there are n numbers and M numbers.
###Output format:
The first line outputs the number of intersection elements;
The second line outputs intersection elements in non descending order, separated by spaces, and there is no space after the last element.
###Input example:
Here is a set of inputs. For example:
```in
5 6
8 6 0 3 1
1 8 9 0 4 5
```
###Output example:
The corresponding output is given here. For example:
```out
three
0 1 8
```
answer：If there is no answer, please comment
###Input format:
The first line is n and m, representing the number of elements of the two sets;
Then there are n numbers and M numbers.
###Output format:
The first line outputs the number of intersection elements;
The second line outputs intersection elements in non descending order, separated by spaces, and there is no space after the last element.
###Input example:
Here is a set of inputs. For example:
```in
5 6
8 6 0 3 1
1 8 9 0 4 5
```
###Output example:
The corresponding output is given here. For example:
```out
three
0 1 8
```
answer：If there is no answer, please comment