Given a String of length S, reverse the whole string without reversing the individual words in it. Words are separated by dots.
Input:
The first line contains T denoting the number of testcases. T testcases follow. Each case contains a string S containing characters.
Output:
For each test case, in a new line, output a single line containing the reversed String.
Constraints:
1 <= T <= 100
1 <= |S| <= 2000
Example:
Input:
2
i.like.this.program.very.much
pqr.mno
Output:
much.very.program.this.like.i
mno.pqr
| lakshmi_pandey | 72 |
| abbatta7 | 68 |
| Ashish Kumar Vaishy | 62 |
| aman19 | 58 |
| Kumar Gaurav Singh | 58 |
| saumitra13325 | 612 |
| ashujack | 551 |
| lakshmi_pandey | 544 |
| aman19 | 538 |
| piyushmittal25 | 514 |
| blackshadows | 5249 |
| akhayrutdinov | 5111 |
| Ibrahim Nash | 5087 |
| Quandray | 4354 |
| sanjay05 | 3668 |