#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353, N = 5e5 + 10;
long long fact[N];
long long inverse(long long i) {
  long long a[30];
  a[0] = i;
  for (long long i = 1; i < 30; i++) a[i] = (a[i - 1] * a[i - 1]) % MOD;
  long long r = MOD - 2, inv = 1;
  for (long long i = 0; i < 30; i++) {
    if (r % 2 == 1) inv = (inv * a[i]) % MOD;
    r /= 2;
  }
  return inv;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  fact[0] = 1;
  for (long long i = 1; i < N; i++) fact[i] = (fact[i - 1] * i) % MOD;
  long long n, k, t = 0;
  cin >> n >> k;
  k--;
  long long invk = inverse(fact[k]);
  for (long long i = 1; i <= n; i++) {
    long long n2 = (n / i) - 1;
    if (k <= n2) {
      if (n2 == 0 && k == 0)
        t = (t + 1) % MOD;
      else
        t = (((fact[n2] * invk) % MOD) * inverse(fact[n2 - k]) + t) % MOD;
    }
  }
  cout << t;
}
