#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long
typedef int uci;
#define int long long
#define F first
#define S second
typedef complex<double> cd;

seed_seq seq{
    (uint64_t) chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
    (uint64_t) __builtin_ia32_rdtsc(),
    (uint64_t) (uintptr_t) make_unique<char>().get()
};
mt19937 rng(seq);
// mt19937_64 lrng(seq);

struct debugger{
    template <typename T>
    debugger& operator<<(T &a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
    template <typename T>
    debugger& operator<<(T &&a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
} deb;

const double PI = acos(-1.0);
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

//! function insert

//THINK FIRST, CODE SECOND
//DON'T GET STUCK ON ONE STRATEGY
//CALM DOWNNN FOR ONCE IN YOUR LIFE
//REDUCE
//COUGH E??!?!?!! O.O
//uwu i see you ryan

map<string, int> vals;
void solve() {
    string s;
    cin >> s;

    int n = s.size();
    vector<ar<int, 8>> dp(n+1);
    for(int i{}; i < n; ++i)
        for(int j{}; j < 8; ++j)
            dp[i][j] = INF;

    for(int i{}; i < 8; ++i)
        dp[n][i] = 0;

    string ss;
    for(int i = n-1; i >= 0; --i){
        for(int j{1}; j <= 4 && i+j <= n; ++j){
            ss = s.substr(i, j);
            if(vals.count(ss)){
                int sm = INF;
                for(int k{}; k < 8; ++k){
                    sm = min(sm, dp[i+j][k]);
                }
                    
                dp[i][vals[ss]] = min(dp[i][vals[ss]], 1 + sm);
            }
        }
    }

    int curr = 0;
    while(curr < n){
        int sm = dp[curr][0];
        int val = 0;
        for(int i{1}; i < 8; ++i){
            if(dp[curr][i] < sm){
                sm = dp[curr][i];
                val = i;
            }
        }
        cout << (val+1);
        if(val == 3)
            curr += 2;
        else{
            curr += (val%4)+1;
        }
    }
    cout << '\n';
}

uci main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    
    vals["I"]  = 0;
    vals["II"]  = 1;
    vals["III"]  = 2;
    vals["IV"]  = 3;
    vals["V"]  = 4;
    vals["VI"]  = 5;
    vals["VII"]  = 6;
    vals["VIII"]  = 7;

    int tc; cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

/*
    random number generator stuff
    num = rng(); gives integer number
    num = uniform_int_distribution<int>(a, b)(rng); -> bounds [a, b]
    num = uniform_real_distribution<double>(a, b)(rng); -> bounds [a, b)
    can also instantiate distributions and call on generator:
    uniform_int_distribution<int> thing(a, b);
    num = thing(rng);
*/
// struct custom_hash {
//     static uint64_t splitmix64(uint64_t x) {
//         // http://xorshift.di.unimi.it/splitmix64.c
//         x += 0x9e3779b97f4a7c15;
//         x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
//         x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
//         return x ^ (x >> 31);
//     }
//     size_t operator()(uint64_t x) const {
//         static const uint64_t FIXED_RANDOM = lrng();
//         return splitmix64(x + FIXED_RANDOM);
//     }
// };