#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const int maxn = 2e7 + 5;
const int mod = 998244353;
int pr[maxn + 5], inv[maxn + 5], cnt;
bool v[maxn + 5];
int mypow(int a, int b) {
    int ans = 1;
    while (b) {
        if (b & 1)
            ans = (ll) ans * a % mod;
        a = (ll) a * a % mod;
        b >>= 1;
    }
    return ans;
}
int n, k;
void init() {
    for (int i = 2; i < maxn; ++i) {
        if (!v[i]) {
            pr[++cnt] = i;
            inv[i] = mypow(mypow(i, k), mod - 2); 
        } 
        for (int j = 1; j <= cnt && pr[j] * i < maxn; ++j) {
            v[i * pr[j]] = 1;
            inv[i * pr[j]] = (ll) inv[i] * inv[pr[j]] % mod;
            if (i % pr[j] == 0)
                break;
        }
    }
} 
int main() {
    cin >> n >> k;
    init();
    ll ans = 1, sum = 1;
    for (int i = 2; i <= n; ++i) {
        sum = sum * i % mod;
        ans = (ans + sum * inv[i] % mod) % mod;
    }
    cout << ans;
    return 0;
}