MOD = 998244353
def mul(a,b):
    res=[[0]*6 for _ in range(6)]
    for i in range(6):
        for j in range(6):
            for k in range(6):
                res[i][j]=(res[i][j]+a[i][k]*b[k][j])%MOD
    return res

def pow_mod(m,k):
    res=[[0]*6 for _ in range(6)]
    for i in range(6):
        res[i][i]=1
    
    while k:
        if k&1:
            res=mul(res,m)
        m=mul(m,m)
        k>>=1
        
    return res

n,k=map(int,input().split())
A=[[0]*6 for _ in range(6)]
for i in range(6):
    for d in range(1,7):
        A[i][(i+d)%6]=pow(6,MOD-2,MOD)
        
A=pow_mod(A,n)
E=[1]+[0]*5

dp=[sum(A[i][j]*E[j] for j in range(6))%MOD for i in range(6)]
print(dp[k]%MOD)