Problem2330--ABC Swap

2330: ABC Swap

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score : 100100 points

Problem Statement

We have three boxes AABB, and CC, each of which contains an integer.
Currently, the boxes AABB, and CC contain the integers XXYY, and ZZ, respectively.
We will now do the operations below in order. Find the content of each box afterward.
  • Swap the contents of the boxes AA and BB
  • Swap the contents of the boxes AA and CC

Constraints

  • 1 \leq X,Y,Z \leq 1001X,Y,Z100
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:
XXYYZZ

Output

Print the integers contained in the boxes AABB, and CC, in this order, with space in between.

Sample Input Copy

1 2 3

Sample Output Copy

3 1 2

Source/Category