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
| DhruvKulshreshtha | 102 |
| Radhaakrishna | 64 |
| Mr_Bean | 58 |
| Rishabh Jain 32 | 58 |
| PRATEEK JAIN 16 | 57 |
| Mr_Bean | 783 |
| Dhirendra121 | 462 |
| kinetic | 360 |
| kevinyu102589 | 358 |
| Guru_console | 330 |
| akhayrutdinov | 4926 |
| Ibrahim Nash | 4448 |
| Quandray | 4261 |
| sanjay05 | 3668 |
| GB11 | 2857 |