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
n = input()
x = []
for i in range(0 ,n):
    x.append(raw_input().split())
for i in x:
    z = len(i)-1
    a = 0
    while a<z:
        temp = i[a]
        i[a] = i[z]
        i[z] = temp
        a = a+1
        z = z-1
    for q in range(0, len(i)):
        print i[q],
    print