#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long fastPow(long long base, long long exp, long long mod) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) res = ((res % mod) * (base % mod)) % mod;
    base = ((base % mod) * (base % mod)) % mod;
    exp /= 2;
  }
  return res % mod;
}
long long fact[500001];
void calculateFact() {
  fact[0] = fact[1] = 1;
  for (long long i = 2; i < 500001; i++) {
    fact[i] = (fact[i - 1] * i) % 998244353;
  }
}
long long ncr(long long n, long long r) {
  long long nm = fact[n];
  long long dn = (fact[r] * fact[n - r]) % 998244353;
  long long res = (nm * fastPow(dn, 998244353 - 2, 998244353)) % 998244353;
  return res;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  calculateFact();
  if (n < k) {
    cout << "0\n";
    return;
  }
  if (k == 1) {
    cout << n << "\n";
    return;
  }
  long long ans = 0;
  for (long long i = 1; i < n + 1; i++) {
    long long cnt = n / i;
    if (cnt >= k)
      ans = (ans + ncr(cnt - 1, k - 1)) % 998244353;
    else
      break;
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long tc = 1;
  while (tc--) {
    solve();
  }
  return 0;
}
