#ifdef local
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#endif
// #pragma comment(linker, "/STACK:102400000,102400000")

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#ifndef local
#define endl '\n'
#endif

#define pb emplace_back
#define fi first
#define se second
// #define endl '\n'
#define rep(i, l, r) for (long long i = l; i <= r; i++)
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef pair<int, int> P;
typedef pair<P, int> PP;
const double pi = acos(-1);
typedef __int128_t int128;
const ll mod = 1e18;
const db eps = 1e-9;
std::mt19937_64 rng(time(0));
ll my_random(ll l, ll r)
{

	uniform_int_distribution<int> range(l, r);
	return range(rng);
}
void __()
{
#ifdef local
	system("pause");
#endif
}

ll qp(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b)
	{
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}
const int maxn = 1e3 + 10;

int check(string s)
{
	reverse(s.begin(), s.end());
	if (s == "I")
		return 1;
	if (s == "II")
		return 2;
	if (s == "III")
		return 3;
	if (s == "IV")
		return 4;
	if (s == "V")
		return 5;
	if (s == "VI")
		return 6;
	if (s == "VII")
		return 7;
	if (s == "VIII")
		return 8;
	return -1;
}

signed main()
{
	IOS;

	int t = 1;
	cin >> t;
	while (t--)
	{
		string s;
		cin >> s;
		int n = s.length();
		vector<int> ans;
		string s1;
		for (int i = n - 1; i >= 0;i--)
		{
			s1 = s1 + s[i];
			if(check(s1) && i>=0)
			{
				string tmp = s1 + s[i-1];
				//cout << "SS " << s1 << " " << tmp << endl;
				if(check(tmp)==-1)
				{
					ans.pb(check(s1));
					s1.clear();
				}
			}
		}
		if(check(s1)!=-1)
			ans.pb(check(s1));
		reverse(ans.begin(), ans.end());
		for(auto x:ans)
			cout << x;
		cout << endl;
	}
	__();
	return 0;
}