Given a String of length N 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. Then follows description of testcases. Each case contains a string containing spaces and characters.
Output:
For each test case, output a single line containing the reversed String.
Constraints:
1<=T<=20
1<=Lenght of String<=2000
Example:
Input:
2
i.like.this.program.very.much
pqr.mno
Output:
much.very.program.this.like.i
mno.pqr
| bol_na_aunty_aau_kya | 82 |
| Apurve Dave | 76 |
| sheraf ansari 1 | 74 |
| rex_wulf | 72 |
| manishSinghal | 71 |
| Apurve Dave | 624 |
| CAGEROT | 576 |
| Manku Pathak | 575 |
| Siddhant Srivastava 1 | 565 |
| Amit Pandey 9 | 562 |
| akhayrutdinov | 4723 |
| Quandray | 3902 |
| sanjay05 | 3668 |
| Ibrahim Nash | 3664 |
| surbhi_7 | 2816 |