Word Reversal

For each list of words, output a line with each word reversed without changing the order of the words.

Input

You will be given a number of test cases. The first line contains a positive integer indicating the number of cases to follow. Each case is given on a line containing a list of words separated by one space, and each word contains only uppercase and lowercase letters.

Output

For each test case, print the output on one line.

Sample Input

3
I am happy today
To be or not to be
I want to win the practice contest

Sample Output

I ma yppah yadot
oT eb ro ton ot eb
I tnaw ot niw eht ecitcarp tsetnoc

Source: East Central North America 1999 Practice

my c++ code :


#include <iostream>
#include <string>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
 
int Str_Int(string str){
    int len=str.length();
    double n=0;   
    for(int i=0;i<str.length();i++){
        n+= (str[i]-48)*(pow(10.0,--len));         
    }
    return static_cast<int>(n);  
}   
 
int main(){
    string str,s;
    getline(cin,str);
    int n=Str_Int(str);
    string *a=new string [n];
    for(int i=0;i<n;i++){
        getline(cin,str);
        a[i]=str;   
    }
    for(int i=0;i<n;i++){
        istringstream sin(a[i]);
        for(int i=0;sin>>s;i++){
            if(i!=0){
               cout<<' ';
            }   
            reverse(s.begin(),s.end());
            cout<<s;
        }
        cout<<endl;                  
    }        
    delete []a;
  
    return 0;
}