Hanuman has been a great admirer of Ram. However, there is one thing that Hanuman finds really difficult when talking to Ram. Hanuman can only understand sentences in reverse order but Ram,though an incarnation of God,is somehow unable to speak in reverse.
Help Ram by creating a program that will generate the sentence(string S) given by Ram in reverse order word by word.

INPUT:
An integer T (1 ≤ T ≤ 1000) : number of testcases
Each test case is represented by a sentence (1 ≤ length_of_sentence ≤ 100)

OUTPUT:
For each test case T, output a sentence which is in the reverse order of that of the user given sentence(word by word and not letter by letter) 

SAMPLE INPUT
3
I have always been fond of you, Hanuman
SpacelessSentence
A B C D 5

SAMPLE OUTPUT
Hanuman you, of fond been always have I
SpacelessSentence
5 D C B A

Difficulty: EASY

Solutions:
t=int(input())
while t:
	t-=1
	a=list(map(str,input().split()))
	a=a[::-1]
	for i in a:
		print(i, end=' ')
	print() 


T=int(input())
for i in range(T):
	words=input().split()
	p=len(words)
	for j in range(p):
		print(words[p-j-1], end=' ')
	print()


tc = eval(input())
for etc in range(tc):
	myString = input()
	myList = myString.split()
	length = len(myList)
	for i in range(length):
		print(myList[length-i-1], end=' ')
	print()