n,k = map(int, input().split()) mod = 998244353 ma = n*n if k > ma: print(0) exit() k = min(k,ma) dp = [[0]*(n+1) for _ in range(k+1)] dp[0][0] = 1 for i in range(1,n*2+1): new = [[0]*(n+1) for _ in range(k+1)] for j in range(k+1): for l in range(n+1): if l+1 <= i//2: new[j][l+1] += dp[j][l] new[j][l+1] %= mod if j+i <= k: ko = i - l new[j+i][l] += dp[j][l] * (ko - l) new[j+1][l] %= mod dp = new ans = dp[-1][-1] for i in range(n): ans *= (i+1) ans %= mod print(ans)