#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

bool chmin(auto &a, auto b) {
    if(a <= b) return false;
    a = b;
    return true;
}

bool chmax(auto &a, auto b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

vector<string> t;

void solve(){
    string s; cin >> s;
    int n = s.size();
    
    vector<bool> seen(n+1);
    vector<int> val(n+1);
    seen[n] = 1;
    val[n] = 0;


    auto calc = [&](auto self, int i) -> int {
        if (seen[i]) return val[i];
        int ret = 1e9;
        rep(j,1,9){
            if ((int)t[j].size() + i > n) continue;
            if (s.substr(i, (int)t[j].size()) == t[j]){
                chmin(ret, self(self, i + (int)t[j].size()) + 1);
            }
        }
        seen[i] = 1;
        val[i] = ret;
        return ret;
    };

    calc(calc, 0);

    int now = 0;
    vector<int> ans;
    while(now < n){
        for (int i=1; i<9; i++){
            if ((int)t[i].size() + now > n) continue;
            if (s.substr(now, (int)t[i].size()) == t[i]
            && val[now] == val[now + (int)t[i].size()] + 1){
                now = now + (int)t[i].size();
                ans.push_back(i);
                break;
            }
        }
    }

    for (int x: ans){
        cout << x;
    }
    cout << '\n';
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    t.resize(0);
    t.push_back("NULL");
    t.push_back("I");
    t.push_back("II");
    t.push_back("III");
    t.push_back("IV");
    t.push_back("V");
    t.push_back("VI");
    t.push_back("VII");
    t.push_back("VIII");

    int taa; cin >> taa;
    while(taa--) solve();
}