#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
const long long MOD = 998244353;
int n, k;
vector<long long> fac, inv;
long long powe(long long x, long long e) {
  long long res = 1;
  while (e) {
    if (e & 1) res = res * x % MOD;
    e >>= 1;
    x = x * x % MOD;
  }
  return res;
}
void init() {
  fac = inv = vector<long long>(n + 1);
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % MOD;
  inv[n] = powe(fac[n], MOD - 2);
  for (int i = n - 1; i >= 0; i--) inv[i] = inv[i + 1] * (i + 1) % MOD;
}
long long combination(int n, int r) {
  if (r > n || r < 0) return 0;
  return fac[n] * inv[r] % MOD * inv[n - r] % MOD;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  init();
  int c = n - k;
  long long res = 0;
  for (int i = 0; i <= c; i++) {
    int sign = i % 2 == 0 ? 1 : -1;
    long long waysExclude = combination(c, i);
    long long waysDistribute = powe(c - i, n);
    res += sign * (waysExclude * waysDistribute % MOD);
    res = ((res % MOD) + MOD) % MOD;
  }
  res = res * combination(n, c) % MOD;
  if (k) res = res * 2LL % MOD;
  cout << res;
}
