#include <bits/stdc++.h>
using namespace std;
int n, k;
int mod_ans = 998244353;
long long a[500000], f[500000], inv[500000];
long long combinatoria(int m, int n) {
  if (m < 0 || m > n) return 0;
  return f[n] * inv[n - m] % mod_ans * inv[m] % mod_ans;
}
long long numero_arrays() {
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    ans += combinatoria(k - 1, n / i - 1);
    ans %= mod_ans;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  inv[1] = 1;
  for (int i = 2; i < 500000; i++) {
    inv[i] = inv[mod_ans % i] * (mod_ans - mod_ans / i) % mod_ans;
  }
  f[0] = 1;
  inv[0] = 1;
  for (int i = 1; i < 500000; i++) {
    f[i] = i * f[i - 1] % mod_ans;
    inv[i] = inv[i] * inv[i - 1] % mod_ans;
  }
  cout << numero_arrays() << endl;
  return 0;
}
