#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int MAXN = 5e5 + 1;
int f[MAXN], inf[MAXN];
void add(int& a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
int power(int a, int b) {
  int res = 1;
  a %= mod;
  while (b > 0) {
    if (b & 1) {
      res = res * 1ll * a % mod;
      b--;
    }
    a = a * 1ll * a % mod;
    b >>= 1;
  }
  return res;
}
int ncr(int n, int r) {
  if (n < r) return 0;
  return f[n] * 1ll * inf[r] % mod * inf[n - r] % mod;
}
void factorial() {
  f[0] = f[1] = inf[0] = inf[1] = 1;
  for (int i = 2; i <= MAXN; i++) {
    f[i] = f[i - 1] * 1ll * i % mod;
    inf[i] = power(f[i], mod - 2);
  }
}
int solve() {
  int n, k;
  cin >> n >> k;
  if (n < k) return 0;
  if (k == 1) return n;
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    int multiples = n / i;
    add(ans, ncr(multiples - 1, k - 1));
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    factorial();
    cout << solve() << '\n';
  }
  return 0;
}
