eolymp
bolt
Try our new interface for solving problems
Problems

Merge three sequences

Merge three sequences

Three sorted sequences are given. Merge them.

Input

First line contains the length of the first sequence k (k105), followed by k sorted integers.

Second line contains the length of the second sequence l (l105), followed by l sorted integers.

Third line contains the length of the third sequence m (m105), followed by m sorted integers.

Output

Merge three given sequences and print the result in one line.

Time limit 1 second
Memory limit 128 MiB
Input example #1
6 3 5 7 9 12 16
5 1 3 4 4 7
6 2 3 5 5 7 8
Output example #1
1 2 3 3 3 4 4 5 5 5 7 7 7 8 9 12 16 
Author Michael Medvedev