#include <bits/stdc++.h>
using namespace std;
long long powe(long long n, long long m) {
  if (m == 0) return 1;
  long long t = powe(n, m / 2);
  if (m % 2 == 0) return (t * t);
  return (((t * t)) * n);
}
long long mpowe(long long n, long long m, long long MOD) {
  if (m == 0) return 1;
  long long t = mpowe(n, m / 2, MOD);
  t %= MOD;
  if (m % 2 == 0) return (t * t) % MOD;
  return (((t * t) % MOD) * n) % MOD;
}
long long logtwo(long long n) {
  if (n == 1) return 0;
  if (n == 0) return -1;
  return logtwo(n / 2) + 1;
}
long long fac[500005], ifac[500005];
long long mod = 998244353;
long long inv(long long arg, long long mod) { return mpowe(arg, mod - 2, mod); }
void preCompute(long long sz) {
  fac[0] = 1;
  for (int i = 1; i <= sz; i++) {
    fac[i] = fac[i - 1] * i;
    fac[i] %= mod;
  }
  ifac[sz] = inv(fac[sz], mod);
  for (long long i = sz - 1; i >= 0; i--)
    ifac[i] = (ifac[i + 1] * (i + 1)) % mod;
}
long long nCr(long long n, long long r) {
  if (n >= r && r >= 0) return (((fac[n] * ifac[n - r]) % mod) * ifac[r]) % mod;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  preCompute(500005);
  while (t--) {
    int n, k;
    cin >> n >> k;
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
      if (n / i >= k) {
        ans = (ans + nCr(n / i - 1, k - 1)) % mod;
      } else {
        break;
      }
    }
    cout << ans << endl;
  }
}
