#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int modInverse(long long int n, long long int p) {
  return power(n, p - 2, p);
}
long long int nCrModPFermat(long long int n, long long int r, long long int p) {
  if (r == 0) return 1;
  long long int fac[n + 1];
  fac[0] = 1;
  for (long long int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % p;
  return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
         p;
}
void solve() {
  long long int n, k;
  long long int mod = 998244353;
  scanf("%lld %lld", &n, &k);
  if (k > n) {
    printf("0\n");
    return;
  }
  long long int ans = 0;
  for (long long int i = 1; i <= n; ++i) {
    long long int l = n / i;
    if (l < k) break;
    ans = (ans + nCrModPFermat(l - 1, k - 1, mod)) % mod;
  }
  printf("%lld\n", ans);
}
int main() {
  long long int t = 1;
  while (t--) {
    solve();
  }
}
