def ack(m,n):
    if(m==0):
        y=n+1
    elif(n==0):
        y=ack(m-1,1)
    else:
        y=ack(m-1,ack(m,n-1))
    return(y)
sr=input().split()
m=int(sr[0])
n=int(sr[1])
print(ack(m,n))
/**************************************************************
	Problem: 1695
	User: admin
	Language: Python
	Result: Accepted
	Time:54 ms
	Memory:34480 kb
****************************************************************/