Problem: Doraemon gave Nobita a gadget that swaps words inside a string in the following manner :

If there are W words, word 1 is swapped with word W, word 2 is swapped with word W-1 and so on.
The problem is that Nobita himself cannot verify the answer for large strings. Help him write a program to do so.

INPUT : 
the first line of the input contains the number of test cases. Each test case consists of a single line containing the string.

OUTPUT :
output the string with the words swapped as stated above.

CONSTRAINTS :
|string length| ≤ 100000
string contains english alphabets and spaces

SAMPLE INPUT
1
hello world

SAMPLE OUTPUT
world hello

Solution (in PYTHON):

Solution:
t=int(raw_input())
s=[]
for w in range(t):
    s1 = raw_input()
    s=s1.split()
    l=len(s)
    for i in range(l/2):
        s[i],s[l-1]=s[l-1],s[i]
        l=l-1
    for i in s:
        print i,
    print ''