#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
const int mod = 998244353;
int g[N][22];
int f[N][22];
int n, m;
int fac[N], ifac[N], inv[N];
vector<int> val[N];

int C(int n, int m) {
    if (n < m || m < 0) return 0;
    return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

int add(int x, int y) {
    return x + y >= mod ? x + y - mod : x + y;
}

void getg(int n, int k) {
    g[n][k] = C(n - 1, m - k);
    for (int l = 2, r = 0; l <= n; l = r + 1) {
        r = n / (n / l);
        g[n][k] = add(g[n][k], mod - 1ll * C(n / l - 1, m - k - 1) * (r - l + 1) % mod);
    }
}

int main() {
    scanf("%d%d", &n, &m);
    inv[1] = fac[0] = fac[1] = ifac[0] = ifac[1] = 1;
    for (int i = 2; i <= n; ++i) {
        fac[i] = 1ll * fac[i - 1] * i % mod;
        inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
        ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
    }
    for (int l = 1, r = 0; l <= n; l = r + 1) {
        r = n / (n / l);
        for (int i = 0; i <= min(m - 1, 20); ++i) {
            getg(n / l, i);
        }
    }
    // cerr << g[4][1] << '\n';
    for (int i = 1; i <= n; ++i) {
        f[i][1] = 1;
    }
    for (int j = 1; j < 20; ++j) {
        for (int i = 1; i <= n; ++i) {
            for (int k = i + i; k <= n; k += i) {
                f[k][j + 1] = add(f[k][j + 1], f[i][j]);
            }
        }
    }
    int ans = 0;
    for (int i = 1; i <= min(m - 1, 20); ++i) {
        for (int j = 1; j <= n; ++j) {
            ans = add(ans, 1ll * f[j][i] * g[n / j][i] % mod * (m - i) % mod);
        }
    }
    ans = add(ans, 1ll * g[n][0] * m % mod);
    printf("%d\n", ans);
    return 0;
}