#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef long double ld;
#define N 201000
#define endl '\n'
ll mod = 998244353;
ll fac[N], invfac[N];
ll qpow(ll x, ll y);
void init(ll n) {
    fac[0] = 1;
    for (ll i = 1; i <= n; i++) {
        fac[i] = fac[i - 1] * i % mod;
    }
    invfac[n] = qpow(fac[n], mod - 2);
    for (ll i = n - 1; i >= 0; i--) {
        invfac[i] = invfac[i + 1] * (i + 1) % mod;
    }
}

ll C(int n, int m) {  // 组合数
    if (m > n || m < 0) {
        return 0;
    }
    return fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
void solve() {
    int m, n;
    cin >> m >> n;
    init(m);
    std::unordered_map<int, std::unordered_map<int, int>> f;
    for (int x = 1; x <= m; x++) {
        f[1][x] = 1;
    }

    ll ans = n * C(m, n) % mod;
    for (int i = 1; i <= n; i++) {  // 枚举长度
        for (auto [x, y] : f[i]) {
            ans = ans - f[i][x] * C(m / x - 1, n - i) % mod;  // 直接枚举倍数
            ans %= mod;
            if (ans < 0) {
                ans += mod;
            }
            for (int j = 2; j * x <= m && i + 1 <= n; j++) {  // 更新倍数链
                f[i + 1][j * x] = (f[i + 1][j * x] + f[i][x]) % mod;
            }
        }
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t--) {
        solve();
    }

}

ll qpow(ll x, ll y) {
    ll sum = 1;
    while (y) {
        if (y & 1)sum = sum * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return sum;
}