Find the values present in A but absent from B.

Input

The first line contains n and m. The next two lines contain arrays A and B.

Array and query counts are between $1$ and $10^5$. Integer values are between $-10^9$ and $10^9$. Deleting a missing multiset value has no effect.

Output

Print the distinct values in A minus B in increasing order. Print an empty line if the set is empty.

Example

Input

6 6
1 9 3 8 0 7
3 1 7 3 7 5

Output

0 8 9