#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int ev, h, n;
    cin>>ev>>h>>n;
    int t[12];
    t[0]=0;
    t[1]=31;
    t[2]=61;
    t[3]=91;
    t[4]=122;
    t[5]=152;
    t[6]=182;
    t[7]=213;
    t[8]=243;
    t[9]=273;
    t[10]=304;
    t[11]=334;
    int s[12];
    s[0]=0;
    s[1]=31;
    s[2]=59;
    s[3]=90;
    s[4]=120;
    s[5]=151;
    s[6]=181;
    s[7]=212;
    s[8]=243;
    s[9]=273;
    s[10]=304;
    s[11]=334;
    if(h==12 and n==31)
    {
        cout<<ev<<" "<<12<<" VN";
        return 0;
    }
  else if(ev%4==0 and h==7 and n==1)
    {
        cout<<ev<<" "<<6<<" SZN";
        return 0;
    }
    else{
    if(ev%4==0)
    {
        for(int i=6; i<12; i++) t[i]++;
        for(int i=2; i<12; i++) s[i]++;
    }
    int p;
    p=s[h-1]+n;
    int *ngr=lower_bound(t, t+12, p);
    int j=ngr-t;
    cout<<ev<<" "<<j<<" "<<p-t[j-1];
}
    return 0;
}