#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

void solve(){

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

     map<string,char> m;
     m["I"]='1';
     m["II"]='2';
     m["III"]='3';
     m["IV"]='4';
     m["V"]='5';
     m["VI"]='6';
     m["VII"]='7';
     m["VIII"]='8';
     

     string sol;

     auto consume=[&](string&x,int y)
	  {
	       if(y<0)return false;
	       if(m[s[y]+x]){
		    x=s[y]+x;
		    return true;
	       }
	       return false;
	  };
     
     int iter=n-1;
     while(iter>=0){
	  string cur(1,s[iter]);
	  
	  while(consume(cur,iter-1))iter--;
	  
	  sol+=m[cur];
	  iter--;
     }

     reverse(sol.begin(),sol.end());
     cout<<sol<<'\n';
}

int main(){
     ios::sync_with_stdio(0);
     cin.tie(0);
     int tt=1;
     cin>>tt;
     while(tt--){
	  solve();
     }
}