Two graders each hand back a list of exam scores already sorted in non-decreasing order. Combine them into a single non-decreasing list that contains every score from both lists (duplicates kept).

Input format

Line 1: two integers n and m, the lengths of the two lists. Line 2: n non-decreasing integers, the first list. Line 3: m non-decreasing integers, the second list.

Output format

One line: the n + m merged scores in non-decreasing order, space-separated.

Constraints

• 1 ≤ n, m ≤ 100000
• -1000000000 ≤ each score ≤ 1000000000
• Each input list is already sorted in non-decreasing order.

3 3
1 4 7
2 3 8

1 2 3 4 7 8

2 4
5 5
1 5 6 9

1 5 5 5 6 9