#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pii=pair<int,int>;

#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) ((int)a.size())

const int N=210005,mod=998244353;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; x=mul(x,x),y>>=1) if(y&1) res=mul(res,x); return res;}
int fac[N],inv[N],ifac[N];
inline int C(int n, int m){if(m<0||m>n) return 0; return mul(fac[n],mul(ifac[m],ifac[n-m]));}
void init_comb(){
    fac[0]=inv[1]=ifac[0]=1;
    for(int i=1; i<N; ++i) fac[i]=mul(fac[i-1],i);
    for(int i=2; i<N; ++i) inv[i]=mul(inv[mod%i],mod-mod/i);
    for(int i=1; i<N; ++i) ifac[i]=mul(ifac[i-1],inv[i]);
}

int n,k;

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    init_comb();
    cin >> n >> k;
    if(n==2){
        cout << "1\n";
        return 0;
    }
    if(n!=6||k==6){
        cout << mul(fac[n-k],k) << "\n";
        return 0;
    }
    int de;
    if(k==2) de=3;
    else if(k==3) de=2;
    else de=1;
    cout << mul(fac[n-k],k*(de+1)) << "\n";
}