#############################
#############
cnb_max=10**6
mod=998244353
#############

kai=[1]*(cnb_max+1)
rkai=[1]*(cnb_max+1)
for i in range(cnb_max):
    kai[i+1]=kai[i]*(i+1)%mod

rkai[cnb_max]=pow(kai[cnb_max],mod-2,mod)
for i in range(cnb_max):
    rkai[cnb_max-1-i]=rkai[cnb_max-i]*(cnb_max-i)%mod

def cnb(x,y):
    if y>x:
        return 0
    if x<0:return 0
    if y<0:return 0
    return (kai[x]*rkai[y]%mod)*rkai[x-y]%mod


def inv(n):
    return kai[n-1]*rkai[n]%mod

##################################


n,k=map(int,input().split())
def naive(n,k):
    def f(s):
        ans=0
        for i in range(1,n):
            if s[i]==1:
                ans+=1
                s[i+1]^=1
        return ans
    ans=0
    for bit in range(2**n):
        s=[0]*(n+1)
        for i in range(n):
            if (bit>>i)&1:s[i+1]=1
        if sum(s)%2==0:ans+=pow(f(s),k,mod)
        ans%=mod
    return ans

def sol1(n,k):
    ans=0
    for i in range(n):
        ans+=pow(i,k,mod)*cnb(n-1,i)
        ans%=mod
    return ans

print(sol1(n,k))

from random import randrange as rd
cnt=0
while 0:
    cnt+=1
    print(cnt)
    n=rd(2,18)
    k=rd(1,2*10**5+1)
    ansn=naive(n,k)
    ans1=sol1(n,k)
    if ans1!=ansn:
        print(n,k)
        exit()