#include<bits/stdc++.h>
#define ll long long
#define db long double 
#define eb emplace_back
#define mk make_pair
#define pi pair<ll,ll>
#define fo(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++) 
#define fd(i,a,b) for(ll (i)=(a);(i)>=(b);(i)--) 
using namespace std; 
const int N=1e6+10;
string s;
int ans[N],len,cnt;
void solve(){
    cin>>s; len=s.length(); cnt=0;
    fd(i,len-1,0){
        if(s[i]=='I'){
            if(i>=1 && s[i-1]=='V') ans[++cnt]=6,i--;
            else if(i>=2 && s[i-2]=='V' && s[i-1]=='I') ans[++cnt]=7,i-=2;
            else if(i>=3 && s[i-3]=='V' && s[i-2]=='I' && s[i-1]=='I') ans[++cnt]=8,i-=3;
            else if(i>=2 && s[i-2]=='I' && s[i-1]=='I') ans[++cnt]=3,i-=2;
            else if(i>=1 && s[i-1]=='I') ans[++cnt]=2,i--;
            else ans[++cnt]=1;
        }
        else{
            if(i>=1 && s[i-1]=='I') ans[++cnt]=4,i--;
            else ans[++cnt]=5;
        }
    }
    fd(i,cnt,1) cout<<ans[i]; cout<<"\n";
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}