#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
template <typename T, typename U>
inline void amin(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
inline void amax(T &x, U y) {
  if (x < y) x = y;
}
template <typename T>
inline void write(T x) {
  int i = 20;
  char buf[21];
  buf[20] = '\n';
  do {
    buf[--i] = x % 10 + '0';
    x /= 10;
  } while (x);
  do {
    putchar(buf[i]);
  } while (buf[i++] != '\n');
}
template <typename T>
inline T readInt() {
  T n = 0, s = 1;
  char p = getchar();
  if (p == '-') s = -1;
  while ((p < '0' || p > '9') && p != EOF && p != '-') p = getchar();
  if (p == '-') s = -1, p = getchar();
  while (p >= '0' && p <= '9') {
    n = (n << 3) + (n << 1) + (p - '0');
    p = getchar();
  }
  return n * s;
}
unsigned long long int num[500001], den[500001];
unsigned long long int nCr(int n, int r) {
  unsigned long long int ans = ((num[n] % 998244353 * den[r] % 998244353) %
                                998244353 * den[n - r] % 998244353) %
                               998244353;
  return ans;
}
unsigned long long int powMod(int x, int y) {
  if (y == 0) {
    return 1;
  }
  unsigned long long int p = powMod(x, y / 2) % 998244353;
  p = (p * p) % 998244353;
  if (y % 2 == 0) {
    return p;
  } else {
    p = (p * x) % 998244353;
    return p;
  }
}
int main() {
  int n, k;
  cin >> n >> k;
  unsigned long long int ans;
  num[0] = 1;
  den[0] = 1;
  for (int i = 1; i <= n; i++) {
    num[i] = i % 998244353 * num[i - 1] % 998244353;
    num[i] = num[i] % 998244353;
  }
  for (int i = 1; i <= n; i++) {
    den[i] = powMod(num[i], 998244353 - 2) % 998244353;
  }
  if (n < k) {
    ans = 0;
  } else if (n == k) {
    ans = 1;
  } else {
    unsigned long long int sum = 0;
    for (int i = 1; i <= n; i++) {
      int d = n / i - 1;
      if (d < (k - 1)) {
        continue;
      }
      sum = sum % 998244353 + nCr(d, k - 1) % 998244353;
      sum = sum % 998244353;
    }
    ans = sum % 998244353;
  }
  cout << ans << endl;
  return 0;
}
