250829

# def f(x):
#     d=0
#     for i in range(2, x):
#         if x%i==0:
#             print('composite')
#             break
#         else:
#             d+=1
#     if d==x-2:
#         print('prime')
#
# n=int(input())
# f(n)

# def f(x):
#     d=0
#     for i in range(1, x+1):
#         if n%i==0:
#             d+=1
#     return d
# n=int(input())
# print(f(n))

# def f(n):
#     d=0
#     global sum
#     global min
#     for i in range(2, n):
#         if n%i==0:
#             break
#         else:
#             d+=1
#     if d==n-2:
#         sum+=n
#         if n<=min:
#             min=n
# x=int(input())
# y=int(input())
# sum = 0
# min = 10000
# for i in range(x, y+1):
#     f(i)
# print(sum, min, sep='\n')
'''
[i, j]
=[i-1, j]+[i, j-1]

*(1, j)=1
*(i, 1)=1


'''

def f(k, p):
    f()
arr=[]
x, y= map(int, input().split())
for i in range(1, 51):
    b=[0]*50
    arr.append(b)

for i in range(1, 51):
    for j in range(1, 51):
       arr[1][j]=1
    arr[i][1]=1
f(x, y)