#include <bits/stdc++.h>
#pragma GCC optimize("03")
using namespace std;
long long int const mod = 998244353;
long long int dp[500100], fact[500100];
long long int power(long long int x, long long int y) {
  long long int res = 1;
  y %= mod;
  x %= mod;
  while (y > 0) {
    if (y & 1ll) {
      res = (res * x) % mod;
      if (res < 0) res += mod;
    }
    y >>= 1;
    x = (x * x) % mod;
    if (x < 0) x += mod;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k, ans, sum = 0, pr = 1, y, x;
  cin >> n >> k;
  if (k == 1) {
    cout << n << "\n";
    return 0;
  }
  long long int fc = 1;
  fact[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    fc = (fc * i) % mod;
    if (fc < 0) fc += mod;
    fact[i] = power(fc, mod - 2);
  }
  y = power(pr, mod - 2);
  pr = 1;
  k -= 1;
  for (long long int i = 1; i <= n; i++) {
    pr = (pr * i) % mod;
    if (pr < 0) pr += mod;
    if (i < (k)) continue;
    dp[i] = (pr * fact[k]) % mod;
    dp[i] = (dp[i] * fact[i - k]) % mod;
    if (dp[i] < 0) dp[i] += mod;
  }
  for (long long int i = 1; i <= n; i++) {
    x = n / i;
    x -= 1;
    if (x < (k - 1)) continue;
    sum = (sum + dp[x]) % mod;
    if (sum < 0) sum += mod;
  }
  cout << sum << "\n";
  return 0;
}
