Finding the Differences

Problem Description

Dazhi encountered a problem in a book he bought:

Given two non-negative integer arrays $A$ and $B$, remove the numbers that appear in both $A$ and $B$, and output the numbers unique to each array. Output the remaining numbers of $A$ first (in their original input order), then those of $B$ (in their original input order).

He now wants to challenge you. Can you solve it?

Input Format

There are three lines in total. The first line contains two integers $n, m$, the numbers of elements in arrays $A$ and $B$ ($1 \le n, m \le 100$).

The second line contains $n$ non-negative integers, the array $A$. A number may appear multiple times. Each number does not exceed $10^5$.

The third line contains $m$ non-negative integers, the array $B$. A number may appear multiple times. Each number does not exceed $10^5$.

The input guarantees that $A$ and $B$ always have some different numbers.

Output Format

One line: first output the remaining numbers of array $A$, then the remaining numbers of array $B$.

Sample Input

4 4
1 5 4 1
2 8 1 6

Sample Output

5 4 2 8 6