#include <bits/stdc++.h>
using namespace std;
long long n, k, sol, fact[(int)(5e5 + 4)];
long long expLog(long long x, long long n) {
  long long sol = 1;
  for (; n; n >>= 1LL) {
    if (n & 1) sol = sol * x % 998244353;
    x = x * x % 998244353;
  }
  return sol;
}
long long C(long long n, long long x) {
  long long inv = expLog(fact[x] * fact[n - x] % 998244353, 998244353 - 2);
  return fact[n] * inv % 998244353;
}
int main() {
  cin >> n >> k;
  fact[0] = 1;
  for (long long i = 1; i < (int)(5e5 + 4) - 2; ++i)
    fact[i] = fact[i - 1] * i % 998244353;
  for (long long i = 1; i <= n; ++i) {
    int cnt = n / i - 1;
    if (cnt < k - 1) break;
    sol = (sol + C(cnt, k - 1)) % 998244353;
  }
  cout << sol;
  return 0;
}
