#include<bits/stdc++.h>
#define int long long
using namespace std;
const int kMaxN = 100005, kMod = 998244353;
int n, m;
int fac[kMaxN], ifac[kMaxN];
std::vector<int> d[kMaxN], f[kMaxN];
int res, ans;
int qpow(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) res = res * a % kMod;
        a = a * a % kMod; b >>= 1;
    }
    return res;
}
int C(int n, int m) {
    if (m < 0 || m > n) return 0;
    return fac[n] * ifac[m] % kMod * ifac[n - m] % kMod;
}
void inc(int &x, int y) { x = (x + y) % kMod; }
void dec(int &x, int y) { x = (x + kMod - y) % kMod; }
void init(int n) {
    fac[0] = ifac[0] = 1;
    for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % kMod, ifac[i] = ifac[i - 1] * qpow(i, kMod - 2) % kMod;
    for (int i = 1; i <= n; ++i) {
        for (int j = 2 * i; j <= n; j += i)
            d[j].emplace_back(i);
    }
}
signed main() {
    // freopen("in.txt", "r", stdin);
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m; init(n);
    int ans = C(n, m) * m % kMod;
    for (int i = 1; i <= n; ++i) {
        f[i].resize(d[i].size() + 2);
        f[i][1] = 1;
        for (auto j : d[i]) {
            for (int k = 1; k < f[j].size(); ++k)
                inc(f[i][k + 1], f[j][k]);
        }
        for (int j = 1; j <= std::min((int)f[i].size() - 1, m); ++j) {
            dec(ans, 1ll * f[i][j] * C(n / i - 1, m - j) % kMod);
            // std::cerr << i << ' ' << j << ' ' << f[i][j] << '\n';
        }
        // std::cerr << i << ' ' << ans << '\n';
    }
    std::cout << ans << '\n';
    return 0;
}