MOD=998244353

N,K=map(int,input().split())
dp=[[[0]*5 for _ in range(K+1)] for _ in range(N)]
dp[0][0][0]=1

def update(i,j,k, val):
    dp[i][j][k]+=val
    dp[i][j][k]%=MOD


c=["z1o-2",
    "z1o--",
    "z1o2-",
    "z--2-",
    "--o-2"]

def cost(f,t,b):
    if (c[f][t]=='-'):
        return 1e9
    if (c[f][t]=='z'):
        return b
    if (c[f][t]=='o'):
        return (not b)
    return int(c[f][t])
    
    

for i in range(1,N):
    for j in range(K+1):
        for f in range(5):
            for t in range(5):
                nj=j+cost(f,t,i&1)
                if (nj>K):
                    continue
                update(i,nj,t,dp[i-1][j][f])

ans=0
if (N&1):
    for k in range(K+1):
        for i in [0,1,2,4]:
            ans+=dp[N-1][k][i]
            ans%=MOD
else:
    for k in range(K+1):
        for i in [0,1,2,3]:
            ans+=dp[N-1][k][i]
            ans%=MOD
print(ans)