#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
const long long mod = 998244353;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - 48;
    ch = getchar();
  }
  return x * f;
}
long long n, tot;
long long fac[N], inv[N];
vector<long long> v;
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ans;
}
bool cmp(int x, int y) { return x > y; }
long long c(long long n, long long m) {
  return (fac[n] * inv[m] % mod) * inv[n - m] % mod;
}
string s;
int main() {
  long long k, q, _;
  long long m;
  fac[0] = 1;
  inv[0] = 1;
  for (int i = 1; i <= 5e5 + 1; i++) {
    fac[i] = (fac[i - 1] * i) % mod;
    inv[i] = (inv[i - 1] * qpow(i, mod - 2)) % mod;
  }
  cin >> n >> m;
  if (n < m)
    cout << 0 << endl;
  else if (n == m)
    cout << 1 << endl;
  else {
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
      if (n / i < m)
        break;
      else {
        ans = (ans + c(n / i - 1, m - 1)) % mod;
      }
    }
    cout << ans << endl;
  }
}
