#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

string digits[8] = {"I", "II", "III", "IV", "V", "VI", "VII", "VIII"};

int check(const string& s) {
    for (int i = 0; i < 8; i++) {
        if (s == digits[i]) {
            return i + 1;
        }
    }
    return -1;
}

void solve() {
    string S;
    cin >> S;

    int n = S.size();
    vector<int> dp(n + 1, INF);
    dp.back() = 0;
    for (int i = n; i > 0; i--) {
        for (int j = 1; j <= 4 and i - j >= 0; j++) {
            if (check(S.substr(i - j, j)) != -1) {
                chmin(dp[i - j], dp[i] + 1);
            }
        }
    }
    string ans = "";
    for (int cur = 0; cur < n;) {
        int mini = INF, nxt = -1, add = -1;
        for (int i = 1; i <= 4 and cur + i <= n; i++) {
            int x = check(S.substr(cur, i));
            if (x == -1) continue;
            if (chmin(mini, dp[cur + i]))
                nxt = i, add = x;
            else if (dp[cur + i] == mini and chmin(add, x))
                nxt = i;
        }
        ans += char('0' + add);
        cur += nxt;
    }

    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}