#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const int N = 500005;
long long fact[N], inv[N];
long long BigMod(long long B, long long P, long long M) {
  long long R = 1;
  while (P > 0) {
    if (P & 1) R = (R * B) % M;
    P = P >> 1;
    B = (B * B) % M;
  }
  return R % M;
}
long long nCr(int n, int r) {
  if (r > n or r < 0) return 0;
  long long up = fact[n];
  long long down = (inv[r] * inv[n - r]) % MOD;
  return (up * down) % MOD;
}
void pre() {
  fact[0] = 1;
  for (int i = 1; i <= N - 1; i++) fact[i] = (fact[i - 1] * (long long)i) % MOD;
  inv[N - 1] = BigMod(fact[N - 1], MOD - 2, MOD);
  for (int i = N - 2; i >= 1; i--) inv[i] = (inv[i + 1] * (i + 1)) % MOD;
  inv[0] = 1;
}
int main() {
  pre();
  int n, k;
  cin >> n >> k;
  if (k > n)
    cout << 0;
  else {
    long long ans = 0;
    for (int i = 1; i <= n; i++) ans = (ans + nCr(n / i - 1, k - 1)) % MOD;
    cout << ans;
  }
}
