#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353, MAX=1000000;
vector<ll> f, finv;

ll inv(ll x){
    ll ans = 1, e = modc-2;
    x %= modc;

    while (e > 0){
        if ((e & 1LL)) ans = (ans * x) % modc;
        e = e >> 1LL;
        x = (x*x) % modc;
    }

    return ans;
}

void init(){
    f.resize(MAX+1); finv.resize(MAX+1);
    f[0] = 1;
    for (int i=1; i<=MAX; i++) f[i] = (f[i-1]*i) % modc;
    finv[MAX] = inv(f[MAX]);
    for (int i=MAX-1; i>=0; i--) finv[i] = (finv[i+1] * (i+1)) % modc;
}

ll C(ll n, ll k){ 
    if (n < k || k < 0) return 0;

    return (((f[n] * finv[k]) % modc) * finv[n-k]) % modc;
}

ll P(ll n, ll k){
    if (n < k || k < 0) return 0;

    return (f[n] * finv[n-k]) % modc;
}

ll H(ll n, ll k){
    if (n == 0 && k == 0) return 1;
    return C(n+k-1, k);
}

int main(){

    init();
    ll N, M, K, ans=0, kf, kfp=1, cp=1;
    cin >> N >> K;
    if (K > N){
        cout << (P(N, N) + modc - 1) % modc << endl;
        return 0;
    }
    kf = P(K-1, K-1);
    M = N/K;
    for (int i=0; i<=M; i++){
        ans += (cp * kfp) % modc * inv(P(i, i)) % modc;
        ans %= modc;
        cp *= C(N-K*i, K);
        cp %= modc;
        kfp *= kf;
        kfp %= modc;
    }

    cout << (P(N, N) + modc - ans) % modc << endl;

    return 0;
}