mod = 998244353

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


K = 32
dp = [0] * (K * (m + 1))
ndp = [0] * (K * (m + 1))
dp[0] = 1

for _ in range(n):
    for d in range(K):
        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 * (m + 1) + ns] += dp[d * (m + 1) + s] * w

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

print(dp[m])