#include <bits/stdc++.h>
using namespace std;
const long long P = 998244353;
long long fact[500005], inv[500005], finv[500005];
inline long long C(int m, int n) {
  if (m > n) return 0;
  if (m == n || m == 0) return 1;
  return fact[n] * finv[m] % P * finv[n - m] % P;
}
int n, k;
int main() {
  ios::sync_with_stdio(false);
  fact[0] = finv[0] = fact[1] = inv[1] = finv[1] = 1;
  for (int i = 2; i <= 500002; ++i) {
    fact[i] = fact[i - 1] * i % P;
    inv[i] = P - inv[P % i] * (P / i) % P;
    finv[i] = finv[i - 1] * inv[i] % P;
  }
  cin >> n >> k;
  long long ans = 0;
  for (int i = 1; i <= n; ++i) ans += C(k - 1, n / i - 1);
  cout << ans % P << endl;
  return 0;
}
