Ход конем 2
n, m = map(int, input().split())
F = [[0] *(m + 3) for i in range(n + 3)]
F[2][2] = 1
starti = 2
startj = 2
while(starti, startj) != (n + 1, m + 1):
    if startj == m + 1:
        starti += 1
    else:
        startj += 1
    i = starti
    j = startj
    while i <= n + 1 and j >= 2:
        F[i][j] = F[i + 1][j - 2] + F[i - 1][j - 2] + F[i - 2][j - 1] + F[i - 2][j + 1]
        i += 1
        j -= 1
print(F[n + 1][m + 1])