#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <cassert>
#include <numeric>

using namespace std;
typedef long long ll;

const int N = 100010, logn = 18;
constexpr int mod = 998244353;

int n, m;
ll fact[N], infact[N];
ll f[N][logn];
ll h[N][logn];
vector<int> factor[N];
vector<int> d;

ll qmi(ll m, ll k, ll p)
{
    ll res = 1 % p, t = m;
    while (k)
    {
        if (k & 1) res = res * t % p;
        t = t * t % p;
        k >>= 1;
    }
    return res;
}

ll inv(ll a)
{
    return qmi(a, mod - 2, mod);
}
 
ll c(int a, int b)
{
    if (a < b) return 0;
    return fact[a] * infact[b] % mod * infact[a - b] % mod;
}

void init()
{
    fact[0] = infact[0] = 1;
    for (int i = 1; i < N; i ++)
        fact[i] = fact[i - 1] * i % mod;
    infact[N - 1] = inv(fact[N - 1]);
    for (int i = N - 2; i >= 1; i --)
        infact[i] = infact[i + 1] * (i + 1) % mod;
}

void solve()
{
    init();
    cin >> n >> m;
    for (int i = 1; i <= n; i ++)
        f[i][1] = 1;
    
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 2; j < logn; j ++)
        {
            for (int x : factor[i])
            {
                if (x == i) continue;
                f[i][j] += f[x][j - 1];
                f[i][j] %= mod;
            }
        }
    }

    for (int l = 1; l <= n; l ++)
    {
        int x = n / l, r = n / x;
        d.push_back(x);
        l = r;
    }

    for (auto x : d)
    {
        for (int k = max(1, m - logn + 1); k <= m; k ++)
        {
            ll g[x + 10] = {0};
            for (int i = x; i >= 1; i --)
            {
                g[i] += c(x / i, k);
                g[i] %= mod;
                for (auto f : factor[i])
                    if (f != i) g[f] -= g[i], g[f] = ((g[f] % mod) + mod) % mod;
            }

            for (int i = 1; i <= x; i ++)
            {
                h[x][m - k] += (((g[i] - c(x / i - 1, k - 1)) % mod) + mod) % mod;  
                // if (i == 1 && x == n && k == 2) cout << h[x][m - k] << '\n';
                h[x][m - k] %= mod;
            }
        }
    }

    ll ans = h[n][0] * m % mod;
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 1; j < logn; j ++)
        {
            ans += f[i][j] * h[n / i][j] % mod * (m - j) % mod;
            // if (f[i][j] && h[n / i][j]) cout << i << ' ' << j << ' ' << f[i][j] * h[n / i][j] << '\n';
            ans %= mod;
        }
    }

    cout << ans << '\n';
}

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

    for (int i = 1; i < N; i ++)
        for (int j = i; j < N; j += i)
            factor[j].push_back(i);
    
    int tt = 1;
    // cin >> tt;
    while (tt --)
    {
        solve();
    }
    return 0;
}