#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long FACT[500001];
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long ccc(long long n, long long k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  if (n == 0 && k == 0) return 1;
  long long s = FACT[n];
  long long s1 = FACT[n - k], s2 = FACT[k];
  s1 = (s1 * s2) % mod;
  long long x, y;
  gcdExtended(s1, mod, &x, &y);
  x = x % mod;
  if (x < 0) x = x + mod;
  return (s * x) % mod;
  return 0;
}
int main() {
  long long n, k, sum = 0;
  cin >> n >> k;
  FACT[0] = 1;
  for (int i = 1; i <= n; i++) {
    FACT[i] = FACT[i - 1] * i % mod;
  }
  for (int i = 1; i <= n; i++) {
    sum = sum + ccc(n / i - 1, k - 1);
    sum = sum % mod;
  }
  cout << sum;
  return 0;
}
