|All-time Popular Problems|
|Transform to Sum Tree|
|Delete N nodes after M nodes of a linked list|
|The Celebrity Problem|
|Consecutive 1's not allowed|
|Pairwise swap elements of a linked list by swapping data|
|Boundary Traversal of binary tree|
|n'th node from end of linked list|
|Longest Common Subsequence|
Given a String of length N reverse the words in it. Words are separated by dots.
The first line contains T denoting the number of testcases. Then follows description of testcases. Each case contains a string containing spaces and characters.
For each test case, output a single line containing the reversed String.
1<=Lenght of String<=2000