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
| blackshadows | 242 |
| xmyqsh | 216 |
| hanuman001 | 172 |
| Adarsh Trivedi | 168 |
| layman_brother | 168 |
| blackshadows | 724 |
| xmyqsh | 557 |
| aman19 | 402 |
| r0c2048 | 360 |
| kspk | 331 |
| akhayrutdinov | 5005 |
| Ibrahim Nash | 4871 |
| Quandray | 4338 |
| sanjay05 | 3668 |
| blackshadows | 3228 |