Given a String of length N reverse the 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
| Anshul Wadhawan | 280 |
| NoobNoob | 203 |
| aild78 | 190 |
| Shivam_Kumar_Singh | 183 |
| stevecooper | 183 |
| rambo | 868 |
| Anshul Wadhawan | 740 |
| Calahan | 677 |
| fullmetal27 | 675 |
| ks75 | 657 |
| akhayrutdinov | 4698 |
| Ibrahim Nash | 3664 |
| sanjay05 | 3633 |
| Quandray | 3491 |
| surbhi_7 | 2748 |