Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you may return the result in any order.

Input format
The first line contains two integers N and M, the sizes of the two arrays. The second line contains the N elements belonging to the array nums1. The third line contains the M elements belonging to the array nums2.

Output format
Return the intersection of the two arrays (also include duplicates in the result).

Sample Input 1
4 2

1 2 2 1

2 2

Sample Output 1
2 2

Explanation
The elements in [2,2] are common to both arrays.

Sample Input 2
3 5

4 9 5

9 4 9 8 4

Sample Output 2
4 9

Explanation
[4, 9] are present in both arrays. [9, 4] will also be accepted as the answer.

Constraints
1 <= N, M <= 1000

0 <= nums1[i], nums2[i] <= 1000


vector<int> intersectionOfTwoArrays2(vector<int>&nums1, vector<int>&nums2){
    vector<int>res;
    return res;
}