#include <bits/stdc++.h>
using namespace std;
vector<long long> inv;
vector<long long> f;
void init(int n) {
  inv = vector<long long>(n + 1);
  f = vector<long long>(n + 1);
  inv[1] = 1;
  for (int i = 2; i < n; ++i) {
    inv[i] = (inv[998244353 % i] * (998244353 - 998244353 / i)) % 998244353;
  }
  f[0] = inv[0] = 1;
  for (int i = 1; i < n; ++i) {
    f[i] = (i * f[i - 1]) % 998244353;
    inv[i] = (inv[i] * inv[i - 1]) % 998244353;
  }
}
long long comb(int a, int b) {
  if (a > b) return 0;
  return (((f[b] * inv[b - a]) % 998244353) * inv[a]) % 998244353;
}
int main(void) {
  int n, k;
  cin >> n >> k;
  if (k <= 0) {
    cout << 0 << "\n";
    return 0;
  }
  init(n);
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    ans = (ans + (comb(k - 1, n / (i + 1) - 1) % 998244353)) % 998244353;
  }
  cout << ans << "\n";
  return 0;
}
