#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <algorithm>
#include <bits/stdc++.h>
#define int long long
#define endl "\n"
#define bit(x) (1LL << x)
using namespace std;

typedef pair<int, int> PII;

void solve()
{
    string s;
    cin >> s;
    const int n = s.size();
    s = "?" + s;
    map<string, int> mp;
    mp["I"] = 1;
    mp["II"] = 2;
    mp["III"] = 3;
    mp["VI"] = 4;
    mp["V"] = 5;
    mp["IV"] = 6;
    mp["IIV"] = 7;
    mp["IIIV"] = 8;
    string t;
    int index = 1;
    int ans = 0;
    for (int i = n; i >= 1 ; i --) {
        t += s[i];
        if (mp.find(t) != mp.end() && i != 1) {
            continue;
        }
        else {
            if (mp.find(t) == mp.end()) {
                i ++;
                t.pop_back();
            }
            ans = ans + index * mp[t];
            index *= 10;
            while (t.size())
                t.pop_back();
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}