n, m = map(int, input().split())
a = []
for i in range(n):
    a.append(list([-1 for j in range(m)]))
a[0][0] = 1
def dp(i, j):
    if i >= 0 and j >= 0 and i < n and j < m:
        if a[i][j] == -1:
            a[i][j] = dp(i-2, j-1) + dp(i-2, j+1) + dp(i-1, j-2) + dp(i+1, j-2)
    else:
        return 0

    return a[i][j]

print(dp(n-1, m-1))