Add to both ends

Problem

A list of orders is stored as nodes. Put a new order x at the front, then add an order y at the end. Print the list.

Input: Line 1: integers separated by spaces. Line 2: x and y.
Output: The new list, values separated by spaces.
Constraints: 1 ≤ number of values ≤ 10000
1 ≤ each value ≤ 1000000000
1 ≤ x, y ≤ 1000000000

Example

Input

5 6 7
1 9

Output

1 5 6 7 9

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

Hint 1

The front insert is Node(x, head).

Hint 2

For the end, walk until node.next is None.

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