#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 7;
const int mod = 998244353;
long long f[N];
long long power(long long a, long long b) {
  long long ans = 1;
  for (; b != 0; b >>= 1) {
    if (b & 1) ans = (long long)ans * a % mod;
    a = (long long)a * a % mod;
  }
  return ans % mod;
}
int main() {
  ios::sync_with_stdio(false);
  f[0] = f[1] = 1;
  for (int i = 2; i < N; i++) f[i] = f[i - 1] * i % mod;
  long long n, k;
  cin >> n >> k;
  int d = n / k;
  long long ans = 0;
  for (int i = 1; i <= d; i++) {
    int s = n / i;
    ans += (((f[s - 1] * power(f[k - 1], mod - 2)) % mod) *
            power(f[s - k], mod - 2)) %
           mod;
    ans %= mod;
  }
  cout << ans << endl;
}
