#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> a, pair<int, int> b) { return true; }
void showvi(vector<int> v) {
  cout << v.size() << endl;
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void showvl(vector<long long> v) {
  for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
void showvp(vector<pair<int, int> > v) {
  for (int i = 0; i < v.size(); i++)
    cout << v[i].first << " " << v[i].second << endl;
}
long long fastpower(long long a, long long n, long long p) {
  long long ans = 1;
  while (n > 0) {
    if (n & 1) ans = (ans * a) % p;
    a = (a * a) % p;
    n = n >> 1;
  }
  return ans % p;
}
vector<bool> prime(1002, true);
void SOE(int n) {
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
long long modInverse(long long n, long long p) {
  return fastpower(n, p - 2, p);
}
long long nCrModPFermat(long long n, long long r, long long p) {
  if (r == 0) return 1;
  long long fac[n + 1];
  fac[0] = 1;
  for (long long i = 1; i <= n; i++) fac[i] = (fac[i - 1] * i) % p;
  return (((fac[n] * modInverse(fac[r], p)) % p) * modInverse(fac[n - r], p) %
          p) %
         p;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  long long ans, p = 998244353;
  if (n < k)
    cout << "0" << endl;
  else if (n == k)
    cout << "1" << endl;
  else if (k == 1)
    cout << n << endl;
  else {
    ans = nCrModPFermat(n - 1, k - 1, p);
    long long v = 2;
    while (n / v >= k) {
      if (n / v == k)
        ans += 1;
      else
        ans += (nCrModPFermat(n / v - 1, k - 1, p)) % p;
      v++;
    }
    cout << ans % p << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
