#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int maxm = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const long long mod = 998244353;
const int maxblock = sqrt(maxn) + 10;
const double eps = 1e-7;
const long long INF = 1e16;
long long fac[maxn], facinv[maxn], inv[maxn];
void init() {
  fac[0] = fac[1] = facinv[0] = facinv[1] = inv[1] = 1;
  for (int i = 2; i < maxn; i++) {
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    fac[i] = fac[i - 1] * i % mod;
    facinv[i] = facinv[i - 1] * inv[i] % mod;
  }
}
long long c(int n, int m) {
  if (n < m) return 0;
  return (1LL * fac[n] * facinv[m] % mod * facinv[n - m] % mod) % mod;
}
long long temp[maxn];
long long cal(int k, int n) {
  if (n < k) return 0;
  long long sum = 0;
  for (int i = 0; i <= n - 1; i++) {
    temp[i] = c(i + k - 2, k - 2);
  }
  for (int i = 0; i < (n - (k - 1)); i++) {
    sum = (sum + (temp[i])) % mod;
  }
  return sum;
}
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  if (k == 1) {
    printf("%d\n", n);
    return 0;
  }
  if (n < k) {
    printf("0\n");
    return 0;
  }
  init();
  long long res = 0;
  for (int i = 0; i <= n - 1; i++) {
    temp[i] = c(i + k - 2, k - 2);
  }
  for (int i = 1; i <= n - 1; i++) {
    temp[i] = (temp[i - 1] + temp[i]) % mod;
  }
  res = temp[n - k];
  for (int i = 2; i <= n; i++) {
    if (n / i - k >= 0) res = (res + temp[n / i - k]) % mod;
  }
  printf("%lld\n", res);
  return 0;
}
