Given a String of length S, reverse the whole string without reversing the individual words in it. Words are separated by dots.
The first line contains T denoting the number of testcases. T testcases follow. Each case contains a string S containing characters.
For each test case, in a new line, output a single line containing the reversed String.
1 <= T <= 100
1 <= |S| <= 2000