import sys
input = sys.stdin.readline
MOD = 998244353
N, K = map(int, input().split())
dp = [0 for _ in range(2*(K+1))]
dp[0] = 1
for i in range(2*N):
    ndp = [0 for _ in range(2*(K+1))]
    for t in range(2*(K+1)):
        if dp[t]==0:
            continue
        k, j = t//(K+1), t%(K+1)
        if j>0:
            nt = k*(K+1)+j-1
            ndp[nt] = (ndp[nt] + dp[t]) % MOD
        if j<K:
            if j+1==K:
                nt = 1*(K+1)+j+1
                ndp[nt] = (ndp[nt] + dp[t]) % MOD
            else:
                nt = k*(K+1)+j+1
                ndp[nt] = (ndp[nt] + dp[t]) % MOD
    dp = ndp
ans = dp[K+1]
print(ans)