mod = 998244353

n, m = map(int, input().split())


K = 31
dp = [[0] * (m + 1) for i in range(K + 1)]
dp[0][0] = 1

for _ in range(n):
    ndp = [[0] * (m + 1) for i in range(K + 1)]
    for d in range(K + 1):
        for s in range(m + 1):
            for diff in range(-1, 2):
                w = 2 - abs(diff)
                nd = abs(d + diff)
                ns = s + nd
                if ns <= m and nd <= K:
                    ndp[nd][ns] += dp[d][s] * w

    for i in range(K + 1):
        for j in range(m + 1):
            dp[i][j] = ndp[i][j] % mod

print(dp[0][m])