#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
int main(void){
	string s;
	string a[]={"XII","I","II","III","IIII","V","VI","VII","VIII","IX","X","XI"};
	int t;
	cin>>s>>t;
	int k=0;
	for(k=0;k<12;k++) if(a[k]==s) break;
	k=(k+t)%12;
	cout<<a[k]<<endl;

	return 0;
}