#include <bits/stdc++.h>
using namespace std;
const long long MAXVAL = (long long)1e18 + 1;
const long long MOD = 998244353ll;
const int INF = 1000000000 + 1;
long long poww(int x, long long pow) {
  if (pow == 0ll) return 1;
  if (pow == 1ll) return x % MOD;
  long long ans = poww(x, pow >> 1) % MOD;
  ans = (ans * ans) % MOD;
  if ((pow & 1)) {
    ans = (ans * x) % MOD;
  }
  return ans % MOD;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int q = 1;
  while (q-- > 0) {
    int n, k;
    cin >> n >> k;
    if (n < k) {
      cout << 0 << endl;
      continue;
    }
    int a = n / k;
    int curN = n / a - 1;
    long long curC = 1;
    for (int x = curN; x > curN - k + 1; --x) {
      curC = (curC * x) % MOD;
    }
    for (int x = 2; x <= k - 1; ++x) {
      curC = (curC * poww(x, MOD - 2)) % MOD;
    }
    long long ans = 0ll;
    while (a > 0) {
      ans += curC;
      ans %= MOD;
      int was = curN;
      --a;
      if (!a) break;
      int now = n / a - 1;
      curN = now;
      for (int x = was + 1; x <= now; ++x) {
        curC = (curC * x) % MOD;
        curC = (curC * poww(x - k + 1, MOD - 2)) % MOD;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
