#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 1000015
#define inf 0x3f3f3f3f

int n;
char s[maxn];
int f[maxn];
string tmp[23]={"00","I","II","III","IV","V","VI","VII","VIII"};

bool isok(int x,int id){
	int n=tmp[id].size();
	For(j,0,n-1) if(s[x+j]!=tmp[id][j]) return 0;
	return 1;
}

void work()
{
	cin>>(s+1);
	n=strlen(s+1);
	s[n+1]=0;
	For(i,n+1,n+4) f[i]=0;
	Rep(i,n,1){
		f[i]=inf;
		For(j,1,8)
			if(isok(i,j)){
				f[i]=min(f[i],f[i+tmp[j].size()]+1);
			}
	}
	int p=1,now=f[1];
	while(p<=n){
		int use=-1;
		For(j,1,8)
			if(isok(p,j) && f[p+tmp[j].size()]==now-1){
				use=j;
				break;
			}
		if(use==-1)assert(0);
		cout<<use;
		p+=tmp[use].size();
		--now;
	}
	puts("");
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}