# 誤解法5 (TLE): 区間の絞り込みをせず、全状態 (2N * N * N^2 ≈ 8.2e7) を素直に回す import sys MOD = 998244353 def main(): N, K = map(int, sys.stdin.read().split()) M = N * N if K > M: print(0) return dp = [[0] * (M + 1) for _ in range(N + 2)] dp[0][0] = 1 for x in range(1, 2 * N + 1): nd = [[0] * (M + 1) for _ in range(N + 2)] for j in range(N + 1): row = dp[j] for s in range(M + 1): v = row[s] if v == 0: continue if j + 1 <= N and s + x <= M: nd[j + 1][s + x] = (nd[j + 1][s + x] + v) % MOD if j > 0: nd[j - 1][s] = (nd[j - 1][s] + v * j) % MOD dp = nd f = 1 for i in range(1, N + 1): f = f * i % MOD print(dp[0][K] * f % MOD) main()