#include "bits/extc++.h"

using namespace std;

template <typename T>
void dbgh(const T& t) {
    cerr << t << endl;
}

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t << " | ";
    dbgh(u...);
}

#ifdef DEBUG
#define dbg(...)                                           \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]" \
         << ": ";                                          \
    dbgh(__VA_ARGS__)
#else
#define cerr   \
    if (false) \
    cerr
#define dbg(...)
#endif

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

constexpr long mod = 998244353;

long bpow(long base, long exp) {
    long ans = 1;
    while (exp) {
        if (exp & 1) {
            ans = (ans * base) % mod;
        }
        base = (base * base) % mod;
        exp >>= 1;
    }
    return ans;
}

void solve() {
    int n, k;
    cin >> n >> k;
    int pfact[n + 1] {}, ppow[n + 1];
    pfact[1] = 1;
    for (int i = 2; i <= n; i++) {
        if (pfact[i]) {
            continue;
        }
        pfact[i] = i;
        if (long(i) * i > n) {
            continue;
        }
        for (int j = i * i; j <= n; j += i) {
            if (!pfact[j]) {
                pfact[j] = i;
            }
        }
    }
    long fact = 1, ans = 0;
    for (int i = 1; i <= n; i++) {
        fact = (fact * i) % mod;
        if (pfact[i] == i) {
            ppow[i] = int(bpow(i, mod - 1 - k));
        } else {
            ppow[i] = int(long(ppow[pfact[i]]) * ppow[i / pfact[i]] % mod);
        }
        ans = (ans + fact * ppow[i]) % mod;
    }
    cout << ans << endl;
}

int main() {
    cin.tie(nullptr);
    cin.exceptions(ios::failbit);
    ios_base::sync_with_stdio(false);
    solve();
}