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.
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.
output the string with the words swapped as stated above.
CONSTRAINTS :
|string length| <= 100000
string contains english alphabets and spaces
|string length| <= 100000
string contains english alphabets and spaces
Sample Input:
1
hello world
Sample Output:
world hello
Python Implementation:
t=int(raw_input())
while(t>0):
s=raw_input()
print ' '.join((s.split(' '))[::-1])
t-=1