#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e7+10, MOD = 998244353;
int fac[N];

int quick_pow(int p, int q)
{
    int res = 1;
    while(q){
        if(q & 1) res = ((res % MOD) * (p % MOD)) % MOD;
        q >>= 1;
        p = ((p % MOD) * (p % MOD)) % MOD;
    }
    return res % MOD;
}

signed main()
{
    int n, k; cin >> n >> k;
    int res = 0, ans = 1;
    fac[0] = 1;
    for(int i = 1; i <= N; i ++)
    {
        ans = ((ans % MOD) * (i % MOD)) % MOD;
        fac[i] = ans;
    }
        
    for(int i = 1; i <= n; i ++)
    {
        int fz = fac[i - 1]; 
        // int fm = quick_pow(i, k); * (quick_pow(fm, MOD - 2) % MOD))
        res = (res + fz)  % MOD;
    }
    cout << res << endl;
}