Merge two sorted price lists

Problem

Two shops each have a price list already sorted from low to high. Print one combined list, also sorted from low to high, using the two-pointer merge.

Input: Line 1: the first list. Line 2: the second list. Values are separated by spaces.
Output: The merged list, separated by single spaces.
Constraints: 1 ≤ length of each list ≤ 50000
1 ≤ each price ≤ 1000000000

Example 1

Input

1 4 9
2 3 10 11

Output

1 2 3 4 9 10 11

Example 2

Input

5
5

Output

5 5

Try the problem first. Open one hint at a time.

Hint 1

Keep one pointer in each list.

Hint 2

When one list ends, append the rest of the other.

Write your Python code, run it on the examples and submit it to hidden tests.