mod = 1e9+7
n,m = map(int,input().split())
dp = [[[0 for i in range(105)] for i in range(105)] for j in range(105) ]
dp[0][0][2] =1
for i in range(n+1):
for j in range(m+1):
for k in range(100):
if k%2==0 and i :
dp[i][j][k] = (dp[i][j][k] +dp[i-1][j][int(k/2)])%mod
if j:
dp[i][j][k] = (dp[i][j][k]+dp[i][j-1][k+1])%mod


print(int(dp[n][m-1][1]))