#include <bits/stdc++.h>
#define int long long

#define F(i, a, b) for (int i = (a); i <= (b); i++)
#define dF(i, a, b) for (int i = (a); i >= (b); i--)
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 200005, M = (N << 1), inf = 1e16, mod = 1e9 + 7;
int n, m, a[N], f[N];
map<string, int> mp;
void solve(int TC) {
	string s;
	cin >> s;
	n = s.size();
	F(i, 1, n) f[i] = inf;
	f[0] = 0;
	F(i, 0, n - 1) {
		string t = "";
		F(j, i + 1, n) {
			t += s[j - 1];
			if (mp.count(t)) {
				f[j] = min(f[j], f[i] * 10 + mp[t]);
			}
			if (t.size() > 5) break;
		}
	}
	cout << f[n] << '\n';
}
signed main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	mp["I"] = 1;
	mp["II"] = 2;
	mp["III"] = 3;
	mp["IV"] = 4;
	mp["V"] = 5;
	mp["VI"] = 6;
	mp["VII"] = 7;
	mp["VIII"] = 8;
	int T;
	cin >> T;
	for (int i = 1; i <= T; i ++) {
		solve(i);
	}
	return 0;
}

// g++ a.cpp -o a -O2 -std=c++14 -fsanitize=undefined,address