Merge Two Sorted Arrays

Easy#arrays #two-pointers #sorting· solved by 0 · time limit 2.0 s

Merge two arrays that are already sorted in non-decreasing order into one sorted array — in $O(n+m)$ using two pointers.

Input

$n$ and the first array, then $m$ and the second array.

The merged array.

$1 \le n, m \le 10^5$

Input

Output

1 2 3 3 4 5 10