# https://github.com/robe2222555/atcoder-lib/blob/main/template/python/main.py import sys input = lambda: sys.stdin.readline().rstrip() def LI(): return list(map(int, input().split())) def II(): return int(input()) INF = 1<<60 mod = 998244353 def solve(): N,K = LI() M = N*(2*N+1)+1 if K>=M: print(0) return pre_dp = [[0]*M for _ in range(N+1)] dp = [[0]*M for _ in range(N+1)] pre_dp[0][0] = 1 for n in range(1, 2*N+1): for i in range(N+1): for j in range(M): if pre_dp[i][j]==0: continue # ( if i+1<=N: dp[i+1][j+n] = (dp[i+1][j+n] + pre_dp[i][j])%mod # ) if i-1>=0: dp[i-1][j] = (dp[i-1][j] + pre_dp[i][j]*i%mod)%mod for i in range(N+1): for j in range(M): pre_dp[i][j] = dp[i][j] dp[i][j] = 0 ans = pre_dp[0][K] for i in range(1, N+1): ans = ans*i%mod print(ans) return def main(): T = 1 for _ in range(T): solve() return if __name__ == '__main__': main()