#include <bits/stdc++.h>
using namespace std;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const double pi = acos(-1.0);
const long long mod = 998244353;
const long long maxn = 5000000;
long long iv[maxn + 1];
void mod_inv() {
  iv[1] = 1;
  for (long long i = 2; i <= maxn; i++) {
    iv[i] = mod - mod / i * iv[mod % i] % mod;
  }
}
long long ncr(long long n, long long r) {
  if (n < r) return 0;
  if (r == 0) return 1;
  int ans = 1;
  for (long long i = 1; i <= n; i++) ans = (ans * i) % mod;
  for (long long i = 1; i <= r; i++) ans = (ans * iv[i]) % mod;
  for (long long i = 1; i <= n - r; i++) ans = (ans * iv[i]) % mod;
  return ans;
}
void solve() {
  mod_inv();
  long long n, k;
  cin >> n >> k;
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    long long m = n / i;
    ans = (ans + ncr(m - 1, k - 1)) % mod;
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  solve();
  return 0;
}
