n,k = map(int,input().split())
m = 2*n+4; mod = 998244353; fa = [1]*(m+1); fi = [1]*(m+1)
for i in range(1,m): fa[i+1] = fa[i]*(i+1)%mod
fi[m] = pow(fa[m],mod-2,mod)
for i in range(m,0,-1): fi[i-1] = fi[i]*i%mod
def cmb(n,r): return fa[n]*fi[n-r]%mod*fi[r]%mod if 0<=r<=n else 0
x = fi[2]; y = fa[3]*fi[4]%mod
def main(n,k,f):
    if n==1: return [1,1,3,3,3,1,1][k]
    m = 2*n+4
    if n%2:
        res = main(n-1,k,0)
        if k==1: res += 1
        if k>1: res += main(n-1,k-1,1)
        if k==2: res += 1
        if k>2: res += main(n-1,k-2,0)
        return res%mod
    elif f:
        b = (k%2==0)*cmb(m//2,k//2)
        c = cmb(m,k)-b
        return (b+c*x)%mod
    else:
        a = (k%4==0)*cmb(m//4,k//4)
        b = (k%2==0)*3*(cmb(m//2,k//2)-a)
        c = cmb(m,k)-b-a
        return (a+b*x+c*y)%mod
print(main(n,k,0))