#include <cstdio>
#include <iostream>
#include <map>
using namespace std;

using ll = long long;
const ll M = 998244353;
const int N = 1e5 + 5;
int n, m, k;

ll fact[N];

ll qp(ll x, ll n) {
    ll ret = 1;
    while (n) {
        if (n & 1) ret = ret * x % M;
        x = x * x % M;
        n >>= 1;
    }

    return ret;
}

ll inv(ll x) {
    return qp(x, M - 2);
}

ll C(ll n, ll k) {
    if (n < k) return 0;

    return fact[n] * inv(fact[k] * fact[n - k] % M) % M;     
}

ll f(int m, int n) {
    if (m - 1 < n) return 0;
    if (n == 0) {
        return 0;
    }
    ll ret = 0;
    for (int i = 2; i + n - 1 <= m; i++) {
        int x = m / i - 1;
        int y = m - i;
        
        ll tot = ((C(y, n - 1) - C(x, n - 1)) % M + M) % M;
        ret = (tot * n % M + ret) % M;
        ret = (ret + f(x + 1, n - 1)) % M;
    }

    return ret;
}

void init() {
    fact[0] = 1;
    for (int i = 1; i < N; i++) {
        fact[i] = fact[i - 1] * i % M;
    }
}

void solve() {
    cin >> m >> n;

    printf("%lld\n", (f(m, n) + f(m, n - 1) % M));

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    init();
    solve();
    return 0;
}