#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
long long exp(long long n, long long m, long long md) {
  long long a = 1;
  while (m > 0) {
    if (m & 1) a = (a * n % md) % md;
    m /= 2;
    n = (n * n) % md;
  }
  return a % md;
}
long long R = MOD;
long long modInverse(long long n) { return exp(n, R - 2, R); }
long long ncr(long long n, long long r) {
  if (r == 0) return 1;
  vector<long long> fac(n + 1, 1);
  for (long long i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % R;
  return ((fac[n] * modInverse(fac[r]) % R) * modInverse(fac[n - r]) % R) % R;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k;
  cin >> n >> k;
  if (k > n)
    cout << 0 << '\n';
  else if (k == 1)
    cout << n << "\n";
  else {
    long long ans = 0;
    for (long long i = 1; i * k <= n; i++) {
      ans += ncr(n / i - 1, k - 1);
      ans %= R;
    }
    cout << ans << '\n';
  }
}
