#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long first, unsigned long long second,
                unsigned long long m) {
  if (second == 0) return 1;
  long long p = power(first, second / 2, m) % m;
  p = (p * p) % m;
  return (second % 2 == 0) ? p : (first * p) % m;
}
long long modInverse(long long a, long long m) {
  long long g = gcd(a, m);
  { return power(a, m - 2, m); }
}
const long long maxn = 500005;
long long fact[maxn];
long long ncr(long long n, long long r) {
  if (n < r) return 0;
  long long temp = fact[n];
  (temp *= modInverse(fact[n - r], 998244353)) %= 998244353;
  (temp *= modInverse(fact[r], 998244353)) %= 998244353;
  return temp;
}
void solve() {
  fact[0] = 1;
  long long n, k;
  cin >> n >> k;
  if (k > n) {
    cout << 0 << "\n";
    return;
  }
  if (k == 1) {
    cout << n << "\n";
    return;
  }
  for (long long i = 1; i <= maxn - 1; i++) {
    fact[i] = (fact[i - 1] * i) % 998244353;
  }
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    long long p = n / i;
    if (p >= 0)
      (ans += ncr(p - 1, k - 1)) %= 998244353;
    else
      break;
  }
  ans %= 998244353;
  cout << ans << "\n";
}
signed main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
