#include <stdio.h>

long long power_mod (long long a, long long b, long long mod_num) {
  long long ans = 1LL;
  
  if (b > 0LL) {
    ans = power_mod(a, b/2LL, mod_num);
    ans = (ans * ans) % mod_num;
    if (b%2LL == 1LL) {
      ans = (ans * (a % mod_num)) % mod_num;
    }
  }
  
  return ans;
}

int main () {
  int n = 0;
  int k = 0;
  
  int res = 0;
  
  long long ans = 0LL;
  long long mod_num = 998244353LL;
  
  long long dp[5001][5001] = {};
  long long inv_n = 0LL;
  
  res = scanf("%d", &n);
  res = scanf("%d", &k);
  
  ans = (long long)n;
  inv_n = power_mod((long long)n, mod_num-2LL, mod_num);
  
  dp[0][0] = 1LL;
  for (int i = 0; i < k; i++) {
    for (int j = 0; j <= n; j++) {
      long long tmp = (dp[i][j]*inv_n)%mod_num;
      if (j > 0) {
        ans += tmp*((long long)j);
        dp[i+1][j-1] += tmp*((long long)j);
        dp[i+1][j-1] %= mod_num;
      }
      if (j < n) {
        dp[i+1][j+1] += tmp*((long long)(n-j));
        dp[i+1][j+1] %= mod_num;
      }
    }
  }
  
  printf("%lld\n", ans%mod_num);
  return 0;
}