#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;

constexpr i64 MOD = 998244353, N = 1e5 + 1145;

i64 fact[N + 1], inv_fact[N + 1], mu[N + 1], is_prime[N + 1];
vector<int> prs;

i64 inv(i64 x) {
    i64 res = 1, pw = MOD - 2;
    while (pw) {
        if (pw & 1) (res *= x) %= MOD;
        (x *= x) %= MOD;
        pw >>= 1;
    }
    return res;
}

i64 dp[20][N + 1];
vector<int> fac[N + 1];

i64 comb(int n, int m) {
    if (m < 0 || n < m) return 0;
    return fact[n] * inv_fact[m] % MOD * inv_fact[n - m] % MOD;
}

void get_mu(int n) {
    fill(is_prime + 1, is_prime + n + 1, 1);
    mu[1] = 1;
    for (int i = 2; i <= n; i++) {
        if (is_prime[i]) mu[i] = -1, prs.push_back(i);
        for (int p : prs) {
            if (p > n / i) break;
            is_prime[i * p] = false;
            mu[i * p] = mu[i] * (i % p ? -1 : 0);
			if (i % p == 0) break;
        }
    }
}

int main() {
    int n, m; cin >> m >> n;
    get_mu(m);
    fact[0] = 1;
    for (int i = 1; i <= m; i++) fact[i] = fact[i - 1] * i % MOD;
    inv_fact[m] = inv(fact[m]);
    for (int i = m - 1; i >= 0; i--) inv_fact[i] = inv_fact[i + 1] * (i + 1) % MOD;

    for (int i = 1; i <= m; i++) {
        for (int j = i + i; j <= m; j += i) {
            fac[j].push_back(i);
        }
    }

    auto get = [&](int n, int c) {
        i64 res = comb(n - 1, c);
        for (int i = 2; i <= n; i++) {
            res += mu[i] * comb(n / i, c);
        }
        return res % MOD;
    };

    i64 ans = 0;
    for (int i = 1; i <= m; i++) {
        dp[0][i] = dp[1][i] = 1;
        for (int c = 2; c < 20; c++) {
            for (int j: fac[i]) (dp[c][i] += dp[c - 1][j]) %= MOD;
        }
        i64 t[20];
        for (int c = 0; c < 20; c++) {
            t[c] = dp[c][i];
            if (c > 0) for (int j: fac[i]) t[c] += dp[c][j];
            t[c] %= MOD;
        }
        for (int c = 0; c < 20; c++) {
            ans += (t[c] * get(m / i, n - c)) % MOD * (n - c) % MOD;
            // if (i == 1) {
            //     cout << format("{} {} {}\n", c, dp[c][i], get(m / i, n - c));
            // }
        }
        ans %= MOD;
    }
    (ans += MOD) %= MOD;

    cout << ans << "\n";
}