#include <bits/stdc++.h>
using namespace std;
long long modulo(long long a, long long b, long long c) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % c;
    }
    y = (y * y) % c;
    b /= 2;
  }
  return x % c;
}
bool primes[500002];
void solve() {
  int n, k;
  cin >> n >> k;
  long long MOD = 998244353;
  long long fact[500002];
  long long invFact[500002];
  fact[0] = 1;
  for (long long i = 1; i <= 500000; i++) {
    fact[i] = (fact[i - 1] * i) % MOD;
  }
  invFact[500000] = modulo(fact[500000], MOD - 2, MOD);
  for (long long i = 500000; i > 0; i--) {
    invFact[i - 1] = (invFact[i] * i) % MOD;
  }
  for (int i = 0; i <= 500000; i++) primes[i] = true;
  if (n < k) {
    cout << 0 << endl;
  } else if (n == k) {
    cout << 1 << endl;
  } else {
    long long ans1 = 0;
    for (int i = 1; i <= n; i++) {
      int h = n / i;
      if (h > 0 && h >= k) {
        long long ans2 = (fact[h - 1] * invFact[k - 1]) % MOD;
        ans2 = (ans2 * invFact[h - k]) % MOD;
        ans1 = (ans1 + ans2) % MOD;
      }
    }
    cout << ans1 << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  solve();
}
