#include <bits/stdc++.h>
using namespace std;
const long long N = 500043;
const long long MOD = 998244353;
long long fact[N];
long long add(long long x, long long y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
long long mul(long long x, long long y) { return (x * 1ll * y) % MOD; }
long long binpow(long long x, long long y) {
  long long z = 1;
  while (y > 0) {
    if (y % 2 == 1) z = mul(z, x);
    x = mul(x, x);
    y /= 2;
  }
  return z;
}
long long inv(long long x) { return binpow(x, MOD - 2); }
long long divide(long long x, long long y) { return mul(x, inv(y)); }
void precalc() {
  fact[0] = 1;
  for (long long i = 1; i < N; i++) fact[i] = mul(i, fact[i - 1]);
}
long long C(long long n, long long k) {
  if (k > n) return 0;
  return divide(fact[n], mul(fact[n - k], fact[k]));
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, k;
  cin >> n >> k;
  long long ans = 0;
  precalc();
  long long x = n / k;
  for (long long i = 1; i <= n; i++) {
    long long d = n / i;
    ans = add(ans, C(d - 1, k - 1));
  }
  cout << ans << "\n";
  return 0;
}
