Given two arrays of integers, find which elements in the second array are missing from the first array.

Example

$arr=[7,2,5,3,5,3]$

$brr=[7,2,5,4,6,3,5,3]$

The $brr$ array is the orginal list. The numbers missing are $[4,6]$.

Notes

If a number occurs multiple times in the lists, you must ensure that the frequency of that number in both lists is the same. If that is not the case, then it is also a missing number.
Return the missing numbers sorted ascending.
Only include a missing number once, even if it is missing multiple times.
The difference between the maximum and minimum numbers in the original list is less than or equal to $100$.

Function Description

Complete the missingNumbers function in the editor below. It should return a sorted array of missing numbers.

missingNumbers has the following parameter(s):

int arr[n]: the array with missing numbers
int brr[m]: the original array of numbers

Returns

int[]: an array of integers

Input Format

There will be four lines of input:

$n$ - the size of the first list, $\textbf{arr}$

The next line contains $n$ space-separated integers $arr\left[i\right]$

$m$ - the size of the second list, $brr$

The next line contains $m$ space-separated integers $brr[i]$

Constraints

$1\leq n,m\leq2\times10^5$
$n\leq m$
$1\leq b r r[i]\leq10^4$
$max(brr)-min(brr)\leq100$

Sample Input
10
203 204 205 206 207 208 203 204 205 206
13
203 204 204 205 206 207 205 208 203 206 205 206 204

Sample Output
204 205 206

Explanation

$\textbf{204}$ is present in both arrays. Its frequency in $\textbf{arr}$ is $2$, while its frequency in $brr$ is $3$. Similarly, $205$ and $\textbf{206}$ occur twice in $\textbf{arr}$, but three times in $brr$. The rest of the numbers have the same frequencies in both lists.

见题面

见题面