#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	VS roman = { "O","I","II" ,"III" ,"IIII" ,"V" ,"VI" ,"VII" ,"VIII" ,"IX" ,"X" ,"XI" ,"XII" };
	string s; int T, t;
	cin >> s >> T;
	for (int i = 1; i <= 12; i++) {
		if (roman[i] == s)t = i;
	}
	t += T;
	//cout << t << " -> ";
	if (t <= 0)t += (0 - t + 11) / 12 * 12;
	else if (12 < t)t -= (t - 12 + 11) / 12 * 12;
	t = t == 0 ? 12 : t;
	//cout << t << endl;
	cout << roman[t] << endl;
}