250903

# def 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)

import sys
sys.setrecursionlimit(10000000)

# def f(k):
#     if k<=2:
#         return 1
#     else:
#         return f(k-1)+f(k-2)
# n=int(input())
# print(f(n))

# def f(k):
#     k=int(k)
#     print(k)
#     if k==1:
#         return
#     if k%2==1:
#         f(3*k+1)
#     else:
#         f(k/2)
#
# n=int(input())
# f(n)

# def f(k):
#   global memo
#   if memo[k]!=0:
#       return memo[k]
#   if k<=2:
#       memo[k]=1
#       return memo[k]
#   else:
#       memo[k]=f(k-1)+f(k-2)
#       return memo[k]
#
# memo=[0]*201
# n=int(input())
# print(f(n)%10009)

def f(k, p):
    global memo
    if memo[k][p]!=0:
        return memo[k][p]
    if k==1||p==1:
        memo[k][p]=1
        return memo[k][p]
    else:
        memo[k][p]=f(k-1, p)+f(k, p-1)
        return memo[k][p]
    
memo=[]
x, y=map(int, input().split())
for i in range(1, 51):
    b=0*[50]
    memo.append(b)
print(f(x, y)%100000000)