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
cases = int(raw_input())
i = 1
output = []
while i <= cases :
    text = raw_input().strip().split()
    l = len(text)
    text = list(text)
    i+=1
    for j in range(int(l/2)):
        temp = text[j]
        text[j] = text[l-1-j]
        text[l-1-j] = temp
    s = " ".join(text)
    output.append(s)
for item in output:
    print(item)