#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	string strAns[12] = {"I","II","III","IIII","V","VI","VII","VIII","IX","X","XI","XII"};
	string str;
	int n = 0;
	cin >> str >> n;
	bool minusFlag = false;
	int how = 0;
	int ans = 0;
	if(str[1] == 'X') minusFlag = true;
	for(int i = 0;i < str.size();i++){
		if(str[i] == 'I') how++;
		if(str[i] == 'X') ans += 10;
		if(str[i] == 'V') ans += 5;
	}
	if(minusFlag) ans -= how;
	else ans += how;

	ans += n - 1;
	while(ans < 0 || ans > 11){
		if(ans < 0) ans += 12;
		else ans -= 12;
	}

	cout << strAns[ans] << endl;

	return 0;
}