#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#define N 100000
using namespace std;
struct node
{
     int cnt,num;
     bool operator<(const node &b)const
          {
          if (cnt!=b.cnt) return cnt<b.cnt;
               else return num<b.num;
          }
};
node f[N+5];
int pre[N+5];
int main()
{
     int t,ti;
     //freopen("input.in","r",stdin);
     ios::sync_with_stdio(false);
     cin.tie(nullptr);
     cin>>t;
     for (ti=1;ti<=t;++ti)
     {
     string s,t;
     cin>>s;
     t=s;
     reverse(s.begin(),s.end());
     int n=s.length(),i,j;
     s=" "+s,t=" "+t;
     for (i=0;i<=n;++i)
          {
          f[i]={N+1,0};
          pre[i]=-1;
          }
     f[0]={0,0};
     for (i = 1; i <= n; ++i)
     {
          if (s[i] == 'I')
          {
               if ((node){f[i - 1].cnt + 1, 1} < f[i])
                    f[i] = {f[i - 1].cnt + 1, 1}, pre[i] = i - 1;
          }
          else if (s[i] == 'V')
          {
               if ((node){f[i - 1].cnt + 1, 5} < f[i])
                    f[i] = {f[i - 1].cnt + 1, 5}, pre[i] = i - 1;
          }
          if (i - 1 >= 1)
          {
               string ss = s.substr(i - 1, 2);
               if (ss == "II")
               {
                    if ((node){f[i - 2].cnt + 1, 2} < f[i])
                         f[i] = {f[i - 2].cnt + 1, 2}, pre[i] = i - 2;
               }
               else if (ss == "VI")
               {
                    if ((node){f[i - 2].cnt + 1, 4} < f[i])
                         f[i] = {f[i - 2].cnt + 1, 4}, pre[i] = i - 2;
               }
               else if (ss == "IV")
               {
                    if ((node){f[i - 2].cnt + 1, 6} < f[i])
                         f[i] = {f[i - 2].cnt + 1, 6}, pre[i] = i - 2;
               }
          }
          if (i - 2 >= 1)
          {
               string ss = s.substr(i - 2, 3);
               if (ss == "III")
               {
                    if ((node){f[i - 3].cnt + 1, 3} < f[i])
                         f[i] = {f[i - 3].cnt + 1, 3}, pre[i] = i - 3;
               }
               else if (ss == "IIV")
               {
                    if ((node){f[i - 3].cnt + 1, 7} < f[i])
                         f[i] = {f[i - 3].cnt + 1, 7}, pre[i] = i - 3;
               }
          }
          if (i - 3 >= 1)
          {
               string ss = s.substr(i - 3, 4);
               if (ss == "IIIV")
               {
                    if ((node){f[i - 4].cnt + 1, 8} < f[i])
                         f[i] = {f[i - 4].cnt + 1, 8}, pre[i] = i - 4;
               }
          }
     }
     string ans;
     int pos=n;
     while (pos>0)
          {
          ans+=to_string(f[pos].num);
          pos=pre[pos];
          }
     //reverse(ans.begin(),ans.end());
     cout<<ans<<"\n";
     }
}