Young Jedi must learn how to talk with Yoda. In every sentence, Yoda moves the first two words to the very end.
Given a sentence, write a program that converts it into Yoda's way of speaking.
The first line contains the number of sentences $N$. Each of the next $N$ lines contains one sentence. Each sentence is at most $100$ characters long and consists of at least $3$ words. Words are separated by spaces.
Convert each sentence into Yoda's way of speaking and print them, one per line, in the given order.