#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin()                    \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

vector<int> vNHonapokNapjai = {0, 31, 30, 30, 31, 30, 30, 31, 30, 30, 30, 30, 31};
vector<int> gHonapokNapjai = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int main()
{
    fast_cin();
    //ifstream cin("in.txt");
    int ev, honap, nap;
    cin >> ev >> honap >> nap;

    if (ev % 4 == 0)
    {
        vNHonapokNapjai[6]++;
        gHonapokNapjai[2]++;
    }

    vector<int> vNSum(13);
    for (int i = 1; i <= 12; i++)
    {
        vNSum[i] = vNSum[i - 1] + vNHonapokNapjai[i];
    }

    int x = 0;
    for (int i = 1; i < honap; i++)
    {
        x += gHonapokNapjai[i];
    }
    x += nap;
    int ind = lower_bound(all(vNSum), x) - vNSum.begin();

    cout << x << " " << ind << " " << vNSum[ind - 1] << '\n';
    if (ind == 6 && x - vNSum[ind - 1] == 31)
    {
        cout << ev << " " << ind << " "
             << "SZN";
    }
    else if (ind == 13 && x - vNSum[ind - 1] == 1)
    {
        cout << ev << " " << ind << " "
             << "VN";
    }
    else
    {
        cout << ev << " " << ind << " " << x - vNSum[ind - 1] << '\n';
    }

    return 0;
}