def findWays(N, M): dp = [[0] * (N * (N + 1) // 2 + 1) for _ in range(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, N * (N + 1) // 2 + 1): dp[i][j] = dp[i - 1][j] + (dp[i - 1][j - i] if j >= i else 0) total_sum = N * (N + 1) // 2 return dp[N][total_sum + M] - dp[N][total_sum - M] N, M = map(int, input().strip().split()) print(findWays(N, M))