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
| surya jeet singh | 307 |
| tech_devil | 188 |
| shubham001 | 185 |
| ramankat | 171 |
| mvsaichaitanya | 170 |
| Anurag_Singh | 750 |
| satyam singh 9 | 614 |
| Mandir-wahi-banega | 604 |
| surya jeet singh | 562 |
| HooHaHa | 533 |
| akhayrutdinov | 4779 |
| Quandray | 4062 |
| sanjay05 | 3668 |
| Ibrahim Nash | 3664 |
| surbhi_7 | 2816 |