def count_splitting_schemes(N, M): dp = [[0] * (N * (N + 1): for i in range(1, N + 1): dp[i][1] = 1 for i in range(2, N + 1): for j in range(1, i * (i + 1): if j >= i: dp[i][j] = dp[i - 1][j] + dp[i - 1][j - i] else: dp[i][j] = dp[i - 1][j] result = 0 for i in range((N * (N + 1): if dp[N][i] != 0 and dp[N][i + M] != 0: result += dp[N][i] * dp[N][i + M] return result N, M = map(int, input().split()) print(count_splitting_schemes(N, M))