Two team rosters each list member IDs in non-decreasing order (a roster may itself contain repeats). Produce the sorted list of every ID that appears in at least one roster, each ID listed exactly once.
Input format
Line 1: two integers n and m, the roster sizes.
Line 2: n non-decreasing integers, the first roster.
Line 3: m non-decreasing integers, the second roster.
Output format
One line: the distinct IDs from either roster, in non-decreasing order, space-separated.
Constraints
- 1 ≤ n, m ≤ 100000
- -1000000000 ≤ each ID ≤ 1000000000
- Both rosters are given in non-decreasing order.