#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void yes() {
  cout << "YES\n";
  return;
}
void no() {
  cout << "NO\n";
  return;
}
void out(long long int n, string dem = "\n") {
  cout << n << dem;
  return;
}
void outs(string str) {
  cout << str << endl;
  return;
}
vector<string> v = {"January",   "February", "March",    "April",
                    "May",       "June",     "July",     "August",
                    "September", "October",  "November", "December"};
void init() {}
void solve(int case_no) {
  string str;
  cin >> str;
  int k;
  cin >> k;
  for (int i = 0; i < 12; i++) {
    if (str == v[i]) k += i;
  }
  k %= 12;
  outs(v[k]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  srand(time(NULL));
  init();
  int t = 1;
  for (int i = 1; i <= t; i++) solve(i);
}
