#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 500001;
int n, k;
long long first[maxn], rf[maxn], iv[maxn];
void init() {
  first[0] = rf[0] = first[1] = rf[1] = iv[1] = 1;
  for (int i = 2; i < maxn; i++) {
    iv[i] = mod - mod / i * iv[mod % i] % mod;
    first[i] = i * first[i - 1] % mod;
    rf[i] = iv[i] * rf[i - 1] % mod;
  }
}
long long C(int x, int y) { return first[x] * rf[y] % mod * rf[x - y] % mod; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  init();
  cin >> n >> k;
  long long ret = 0;
  for (int i = 1; k * i <= n; i++) {
    (ret += C(n / i - 1, k - 1)) %= mod;
  }
  cout << ret << '\n';
  return 0;
}
