// package csp;
import java.util.*;
import java.io.*;
public class Main {
public static int N=1010;
public static int a[]=new int [N];
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner cin=new Scanner(new BufferedInputStream(System.in));
int y=cin.nextInt(),d=cin.nextInt(),cnt=0;
while(d>=28)
{
cnt+=1;
if(cnt==1||cnt==3||cnt==5||cnt==7||cnt==8||cnt==10||cnt==12) {
if(d>31) d-=31;
else {
cnt--;
break;
}
}
else if(cnt==2)
{
if(isLeap(y)) {
if(d>29) d-=29;
else {
cnt--;
break;
}
}
else {
if(d>28) d-=28;
else {
cnt--;
break;
}
}
}else {
if(d>30) d-=30;
else {
cnt--;
break;
}
}
}
System.out.println(cnt+1);
System.out.print(d);
}
public static boolean isLeap(int x)
{
if((x%4==0&&x%100!=0)||(x%400==0))
return true;
else return false ;
}
}