#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const ll N = 500043;
const ll mod = 998244353;
ll fact[N];
ll add(ll x, ll y) {
  x += y;
  while (x >= mod) x -= mod;
  while (x < 0) x += mod;
  return x;
}
ll mul(ll x, ll y) { return (x * 1ll * y) % mod; }
ll quicmod(ll x, ll y) {
  ll z = 1;
  while (y > 0) {
    if (y % 2 == 1) z = mul(z, x);
    x = mul(x, x);
    y /= 2;
  }
  return z;
}
ll inv(ll x) { return quicmod(x, mod - 2); }
ll divide(ll x, ll y) { return mul(x, inv(y)); }
void precalc() {
  fact[0] = 1;
  for (ll i = 1; i < N; i++) fact[i] = mul(i, fact[i - 1]);
}
ll C(ll n, ll k) {
  if (k > n) return 0;
  return divide(fact[n], mul(fact[n - k], fact[k]));
}
int main() {
  ll n, k;
  cin >> n >> k;
  ll ans = 0;
  precalc();
  for (ll i = 1; i <= n; i++) {
    ll d = n / i;
    ans = add(ans, C(d - 1, k - 1));
  }
  cout << ans << endl;
}
