#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long fac[500003];
long long ifac[500003];
long long inv[500003];
long long C(long long n, long long k) {
  if (k > n)
    return 0;
  else
    return ((fac[n] * ifac[n - k]) % MOD * ifac[k]) % MOD;
}
int main() {
  inv[1] = 1;
  fac[0] = ifac[0] = 1;
  for (int i = 2; i <= 500000; i++)
    inv[i] = MOD - (MOD / i) * inv[MOD % i] % MOD;
  for (int i = 1; i <= 500000; i++) {
    fac[i] = (i * fac[i - 1]) % MOD;
    ifac[i] = (inv[i] * ifac[i - 1]) % MOD;
  }
  int n, k;
  scanf("%d %d", &n, &k);
  long long res = 0;
  for (int i = 1; i <= n; i++) {
    res = (res + C(n / i - 1, k - 1)) % MOD;
  }
  printf("%lld\n", res);
}
