#include <bits/stdc++.h>
using namespace std;
long long zero = 0;
long long one = 1;
long long MAX_SIZE_5 = 500005;
long long MAX_SIZE_6 = 1000005;
long long max_ll = LLONG_MAX;
long long min_ll = LLONG_MIN;
int max_int = INT_MAX;
int min_int = INT_MIN;
long long mod = 998244353;
long long my_pow(long long a, long long b, long long m = mod) {
  if (b == 0) {
    return 1 % m;
  }
  if (b == 1) {
    return a % m;
  }
  long long temp = my_pow(a, b / 2, m);
  if (b % 2 == 0) {
    return (temp * temp) % m;
  } else {
    return (((temp * temp) % m) * a) % m;
  }
}
long long mod_inv(long long x, long long m = mod) {
  return my_pow(x, m - 2, m);
}
vector<long long> fact(MAX_SIZE_5);
vector<long long> inv_fact(MAX_SIZE_5);
void compute_fact() {
  fact[0] = 1;
  inv_fact[0] = 1;
  for (int i = 1; i <= MAX_SIZE_5 - 1; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    inv_fact[i] = (inv_fact[i - 1] * mod_inv(i)) % mod;
  }
}
long long nCrMOD(long long n, long long r, long long m = mod) {
  if (r > n || r < 0) return 0;
  long long num = fact[n];
  long long den1 = inv_fact[r];
  long long den2 = inv_fact[n - r];
  long long ans = (((num * den1) % m) * den2) % m;
  return ans;
}
void solve() {
  long long n, k;
  cin >> n >> k;
  compute_fact();
  if (k > n) {
    cout << 0 << endl;
    return;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = (ans + nCrMOD(n / i - 1, k - 1)) % mod;
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
