#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const double err = 1e-10;
const int N = 5e5 + 5;
int n, k;
vector<int> facs(N, 0);
void calcfacs() {
  facs[0] = 1;
  facs[1] = 1;
  for (int i = 2; i < N + 1; i++) {
    facs[i] = (1ll * facs[i - 1] * i) % MOD;
  }
}
int binpow(int aa, int xx) {
  int anss = 1;
  while (xx > 0) {
    if (xx & 1) {
      anss = (1ll * anss * aa) % MOD;
    }
    xx /= 2;
    aa = (1ll * aa * aa) % MOD;
  }
  return anss;
}
int ncr(int nn, int rr) {
  if (nn < rr) return 0;
  if (nn == rr || rr == 0) return 1;
  int anss = facs[nn];
  anss = (1ll * anss * binpow(facs[rr], MOD - 2)) % MOD;
  anss = (1ll * anss * binpow(facs[nn - rr], MOD - 2)) % MOD;
  return anss;
}
void solve() {
  cin >> n >> k;
  if (n < k) {
    cout << 0 << endl;
    return;
  }
  long long ans = 0;
  for (int i = 1; i < n - k + 2; i++) {
    ans = (ans + ncr(n / i - 1, k - 1)) % MOD;
  }
  cout << ans << endl;
}
int main() {
  calcfacs();
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  while (T--) solve();
  return 0;
}
