#include <bits/stdc++.h>
using namespace std;
long long modi(long long n) {
  long long prod = n, ret = 1, md = 998244353 - 2;
  while (md) {
    if (md % 2) ret = (ret * prod) % 998244353;
    prod = (prod * prod) % 998244353;
    md /= 2;
  }
  return ret;
}
long long fun(long long n, long long k) {
  if (k > n) return 0;
  long long sum = 1;
  for (int i = 1; i <= k; i++)
    sum = ((sum * (n - i + 1)) % 998244353 * modi(i)) % 998244353;
  return sum;
}
int main() {
  int t = 1;
  while (t--) {
    int n, k, cnt;
    long long res = 0;
    cin >> n >> k;
    vector<bool> flags(n + 1);
    for (int i = 2; i <= n; i++) {
      cnt = n / i - 1;
      res = (res + fun(cnt, k - 1)) % 998244353;
    }
    cout << (res + fun(n - 1, k - 1)) % 998244353 << endl;
  }
}
