#pragma GCC optimize(3)  //O2优化开启
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
const int mod=998244353;
const int MX=0x3f3f3f3f3f3f3f3f; 

int dp[200005];
int sum[200005];
int n;
map<string,int>hh;
void yu(){
    hh["I"]=1;
    hh["II"]=2;
    hh["III"]=3;
    hh["IV"]=4;
    hh["V"]=5;
    hh["VI"]=6;
    hh["VII"]=7;
    hh["VIII"]=8;
}

void icealsoheat(){
    
    string s;

    cin>>s;
    n=s.size();

    s=" "+s;
    dp[n+1]=0;
    dp[n]=1;

    for(int i=n;i>=1;i--){
        dp[i]=dp[i+1]+1;
        if(s[i]=='V'){

            for(int j=i+1;j<=n&&j<=i+3;j++){

                if(s[j]=='V')break;

                dp[i]=min(dp[i],dp[j+1]+1);

            }

        }
        else{

            for(int j=i+1;j<=n&&j<=i+2;j++){

                if(s[j]=='V'&&j!=i+1)break;

                dp[i]=min(dp[i],dp[j+1]+1);

                // if(i==1)cout<<j<<"+++\n";

                if(s[j]=='V')break;

            }

        }

    }

    vector<int> ans;
    string op;

    for(int i=1;i<=n;i++){
        op+=s[i];
        if(dp[i]!=dp[i+1]){
            ans.push_back({hh[op]});
            op="";
        }
    }

    for(auto i:ans)cout<<i;
    cout<<"\n";

    // for(int i=1;i<=n;i++)cout<<dp[i]<<" ";

}
signed main(){
    ios::sync_with_stdio(false);          //int128不能用快读！！！！！！
    cin.tie();
    cout.tie();
    int _yq;
    _yq=1;
    yu();
    cin>>_yq;
    while(_yq--){
        icealsoheat();
    }
}
//
//⠀⠀⠀             ⠀⢸⣿⣿⣿⠀⣼⣿⣿⣦⡀
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠀⠀⠀ ⠀⢸⣿⣿⡟⢰⣿⣿⣿⠟⠁
//⠀⠀⠀⠀⠀⠀⠀⢰⣿⠿⢿⣦⣀⠀⠘⠛⠛⠃⠸⠿⠟⣫⣴⣶⣾⡆
//⠀⠀⠀⠀⠀⠀⠀⠸⣿⡀⠀⠉⢿⣦⡀⠀⠀⠀⠀⠀⠀ ⠛⠿⠿⣿⠃
//⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⣦⠀⠀⠹⣿⣶⡾⠛⠛⢷⣦⣄⠀
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣧⠀⠀⠈⠉⣀⡀⠀ ⠀⠙⢿⡇
//⠀⠀⠀⠀⠀⠀⢀⣠⣴⡿⠟⠋⠀⠀⢠⣾⠟⠃⠀⠀⠀⢸⣿⡆
//⠀⠀⠀⢀⣠⣶⡿⠛⠉⠀⠀⠀⠀⠀⣾⡇⠀⠀⠀⠀⠀⢸⣿⠇
//⢀⣠⣾⠿⠛⠁⠀⠀⠀⠀⠀⠀⠀⢀⣼⣧⣀⠀⠀⠀⢀⣼⠇
//⠈⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⡿⠋⠙⠛⠛⠛⠛⠛⠁
//⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣾⡿⠋⠀
//⠀⠀⠀⠀⠀⠀⠀⠀⢾⠿⠋⠀
//