#include <bits/stdc++.h>
using namespace std;
long long int modInverse(long long int a) {
  long long int m = 998244353;
  long long int m0 = m;
  long long int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long int q = a / m;
    long long int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
void solve() {
  long long int n, k, i;
  cin >> n >> k;
  vector<long long int> fact(n + 1, 1), ifact(n + 1);
  for (i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % 998244353;
  }
  for (i = 0; i <= n; i++) {
    ifact[i] = modInverse(fact[i]);
  }
  long long int ans = 0;
  for (i = 1; i <= n; i++) {
    long long int left = (n - i) / i;
    long long int choose = (k - 1);
    if (left >= choose) {
      long long int val = fact[left];
      val = (val * ifact[left - choose]) % 998244353;
      val = (val * ifact[choose]) % 998244353;
      ans += val;
      ans %= 998244353;
    }
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
