#include <bits/stdc++.h>
using namespace std;

#define int long long
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lep(i,a,b) for(int i=(a); i<=(b);i++)
#define rep(i,a,b) for (int i = (a); i >= b; i--)

const int inf = 1e9 + 5;

vector<string> nums = {".","I","II","III","IV","V","VI","VII","VIII"};
map<string,int> vals;


void solve() {
    string S;
    cin >> S;
    int n = S.size();
    vector<int> dp(n+1, inf);
    dp[n]=0;
    dp[n-1] = 1;
    rep(i,n-2,0) {
        lep(len,1,4) {
            if (i+len-1>n-1) continue;
            string T = S.substr(i,len);
            if (vals.count(T)) {
                dp[i] = min(dp[i], dp[i+len]+1);
            }
        }
    }
    vector<int> ans;
    int rem = dp[0];
    int cur_idx = 0;
    while (rem > 0) {
        // cout << "rem: " << rem << "\n";
        if (rem == 1) {
            string T = S.substr(cur_idx, n-cur_idx);
            ans.pb(vals[T]);
        } else {
            lep(i,1,8) {
                // cout << "iterating over i = " << i << "\n";
                string num = nums[i];
                int len = (int)num.size();
                if (cur_idx+len-1>n-1) continue;
                string T = S.substr(cur_idx,len);
                // cout << "num: " << num << ", T: " << T << "\n";
                if (num == T and dp[cur_idx+len]==dp[cur_idx]-1) {
                    ans.pb(i);
                    // cout << "i: " << i << "\n";
                    cur_idx += len;
                    break;
                }
            }
        }
        rem--;
    }
    for (int x: ans) {
        cout << x;
    }
    cout << "\n";
}

signed main() {
    lep(i,1,8) {
        vals[nums[i]] = i;
    }
    int t; cin >> t;
    while (t--) solve();
}