mod=998244353
inv=[pow(i,mod-2,mod) for i in range(9999)]
N,K=map(int,input().split())
M=N-K
DP=[[0]*(N+1) for i in range(K+1)]
for i in range(K+1):
  DP[i][N]=1
for i in range(K-1,-1,-1):
  C=[0]*(N+2)
  for j in range(N+1):
    C[j+1]=C[j]+DP[i+1][j]
    if C[j+1]>=mod:
      C[j+1]-=mod
  for j in range(i,N):
    if j-i<M:
      DP[i][j]=(C[N+1]-C[j+1])*inv[N-j]%mod
    else:
      DP[i][j]=DP[i+1][j+1]
print(DP[0][0])