Merging Two Sorted Arrays

You are given two arrays $A$ and $B$, each sorted in non-decreasing order. Write a program that combines all of their elements and prints them in non-decreasing order.

The first line contains the size $N$ of array $A$ and the size $M$ of array $B$, separated by a space. ($1 \le N, M \le 10^6$)

The second line contains the $N$ elements of array $A$, and the third line contains the $M$ elements of array $B$, separated by spaces. Every element is an integer whose absolute value is at most $10^9$, and both arrays are already sorted in non-decreasing order.

On the first line, print the combined elements of both arrays in non-decreasing order, separated by single spaces. If a value appears several times, print it as many times as it appears.