#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long poww(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return res;
}
long long fac[500005];
long long c(long long n, long long m) {
  if (n < m || n < 0 || m < 0) return 0;
  return fac[n] * poww(fac[m], mod - 2) % mod * poww(fac[n - m], mod - 2) % mod;
}
signed main() {
  fac[0] = 1;
  fac[1] = 1;
  for (long long i = 2; i < 500005; i++) fac[i] = fac[i - 1] * i % mod;
  long long n, k;
  scanf("%lld%lld", &n, &k);
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    ans = (ans + c(n / i - 1, k - 1)) % mod;
  }
  printf("%lld\n", ans);
  return 0;
}
