#pragma GCC optimize(3)
#include <bits/stdc++.h>

#ifndef ONLINE_JUDGE
#include "../../dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
#define IOS_FAST ios::sync_with_stdio(false), cin.tie(0);

using namespace std;

using ll = long long;
// #define int ll

constexpr int MOD = 998244353;
constexpr int MAXN = 1e5 + 10;
int nn[MAXN];
int rr[MAXN];

int mod(ll x) { return (x % MOD + MOD) % MOD; }

int qpow(int a, int b)
{
    int ans = 1;
    int res = mod(a);
    for (; b; b >>= 1)
    {
        if (b & 1)
        {
            ans = ((ll)res * (ll)ans) % MOD;
        }
        res = ((ll)res * (ll)res) % MOD;
    }
    return ans;
}

int getinv(int x)
{
    return qpow(x, MOD - 2);
}

void pre()
{
    nn[0] = 1;
    for (int i = 1; i < MAXN; ++i)
    {
        nn[i] = ((ll)nn[i - 1] * i) % MOD;
    }
    rr[MAXN - 1] = getinv(nn[MAXN - 1]);
    rr[0] = 1;
    for (int i = MAXN - 2; i >= 1; --i)
    {
        rr[i] = ((ll)rr[i + 1] * (i + 1)) % MOD;
    }
}

int getC(int u, int v)
{
    if (u < v) return 0;
    assert(u >= 0 && v >= 0);
    return ((ll)nn[u] * (ll)rr[v]) % MOD * rr[u - v] % MOD;
}

int ans;
void dfs(int num, int time, const int m, const int n)
{
    if (n <= time)
    {
        // cerr << num << ": " << 1 << '\n';
        ans = ((ll)ans + 1) % MOD;
        return;
    }
    for (int i = 2; i <= m; ++i)
    {
        if (num * i > m) break;
        const int cnt = (m / num - (num * i) / num);
        const int tmp = getC(cnt, n - time - 1);
        // cerr << num << ": " << tmp << '\n';
        ans = ((ll)ans + tmp) % MOD;
        dfs(num * i, time + 1, m, n);
    }
}

signed main()
{
    IOS_FAST;
    pre();
    int m, n;
    cin >> m >> n;
    ans = 0;

    for (int i = 1; i <= m; ++i)
    {
        dfs(i, 1, m, n);
    }
    // dbg(ans, m, n);
    ans = mod((ll)getC(m, n) * n - ans);
    cout << ans << '\n';
    return 0;
}