#include<iostream>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<climits>
#include<numeric>
#include<set>
#include<sstream>
#include<map>
#include<vector>
#include<string>
#include<regex>

using namespace std;

const long long MOD = (long long)(1e9 + 7);

vector<string> split(const string& haystack, const string& needle) {
	vector<string> result;
	size_t start_pos = 0;
	size_t found_pos = haystack.find(needle, start_pos);
	while (found_pos != string::npos) {
		size_t count = found_pos - start_pos;
		string token = haystack.substr(start_pos, count);
		if (!token.empty()) {
			result.push_back(token);
		}
		start_pos = found_pos + needle.length();
		found_pos = haystack.find(needle, start_pos);
	}

	string last_token = haystack.substr(start_pos);
	if (!last_token.empty()) {
		result.push_back(last_token);
	}
	return result;
}

int main() {
	int query;cin >> query;
	map<char, int> value = {
		{'I',1},{'V',5},{'X',10},{'L',50},{'C',100},{'D',500},{'M',1000}
	};
	for (int i = 1;i <= query;i++) {
		string s;cin >> s;
		long long sum = value[s.back()];
		for (int j = s.size() - 2;j >= 0;j--) {
			if (value[s[j]] >= value[s[j + 1]]) {
				sum = sum + value[s[j]];
			}
			else {
				sum = sum - value[s[j]];
			}
		}
		cout << sum << endl;
	}
	return 0;
}