n, k = map(int, input().split()) # k の上限は、1 + 3 + 5 + ... + 2*n-1 = n*(n+1) - n = n*n k = min(k, n*n+1) mod = 998244353 dp = [[[0]*(k+1) for _ in range(n+1)] for _ in range(2*n+1)] # dp[i][j][l]: i 番目まで見て、左半分に j 個置いて、左半分の和が l # dp[0][0][0] = 1 dp[1][1][1] = n # 1 は左半分に置くしかない for i in range(1, 2*n): for j in range(n+1): for l in range(k+1): dp[i][j][l] %= mod # 右に置く dp[i+1][j][l] += dp[i][j][l] * (j*2 - i) % mod if j + 1 <= n and l + i + 1 <= k: # 左に置く dp[i+1][j+1][l+i+1] += dp[i][j][l] * (n - j) % mod # print(*dp[i]) # print(*dp[2*n]) print(dp[2*n][n][k] % mod)