#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>

using namespace std;

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

string A[] = {"I","II","III","IIII","V","VI","VII","VIII","IX","X","XI","XII"};
map<string, int> m;

signed main()
{
    for (int i = 0; i < 12; ++i) m[A[i]] = i;
    string S1; int T; cin >> S1 >> T;

    int now = m[S1];

    if (T > 0) {
        for (int i = 0; i < T; ++i) {
            if (now + 1 >= 12) now = 0;
            else now += 1;
        }
    } else {
        for (int i = 0; i < abs(T); ++i) {
            if (now - 1 < 0) now = 11;
            else now -= 1;
        }
    }

    cout << A[now] << endl;
}