#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define me(f, x) memset(f, x, sizeof(f))
#define mc(f, g) memcpy(f, g, sizeof(g))
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 1e5 + 9;
constexpr int P = 998244353;
int n, m, f[N][20];

IL constexpr int qpow (int b, int k = P - 2) {
  int r = 1;
  for (; k; k >>= 1, b = (LL)b * b % P) if (k & 1) r = (LL)r * b % P;
  return r;
}

int fc[N], ifc[N];

void init (int Z) {
  fc[0] = 1;
  L (i, 1, Z) {
    fc[i] = (LL)fc[i - 1] * i % P;
  }
  ifc[Z] = qpow(fc[Z]);
  R (i, Z - 1, 0) {
    ifc[i] = (LL)ifc[i + 1] * (i + 1) % P;
  }
}

IL int C (int n, int m) {
  return n < m || m < 0 ? 0 : fc[n] * (LL)ifc[m] % P * ifc[n - m] % P;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> m >> n;
  init(m);
  int ans = 0;
  L (i, 1, m) {
    (f[i][1] += 1) %= P;
    int c = m - i, d = m / i - 1;
    ans = (ans + (LL)(C(c, n - 1) - C(d, n - 1) + P) * n) % P;
    for (int j = 2 * i; j <= m; j += i) {
      L (k, 2, 17) {
        int x = f[i][k - 1];
        if (x) {
          (f[j][k] += x) %= P;
          c = m / i - j / i;
          d = m / j - 1;
          ans = (ans + (C(c, n - k) - C(d, n - k) + P) * (LL)x % P * (n - k + 1)) % P;
        }
      }
    }
  }
  cout << ans << '\n';
}
// I love WHQ!