#include <bits/stdc++.h>
using namespace std;

using LL = long long;

constexpr int P = 998244353;
struct Mint {
  int v;
  Mint(int x = 0) : v(x) {v += v >> 31 & P;}
  int val() const {return v;}
  Mint operator-() const {return -v;}
  Mint &operator+=(const Mint &b) {
    v += b.v - P, v += v >> 31 & P;
    return *this;
  }
  Mint &operator-=(const Mint &b) {
    v -= b.v, v += v >> 31 & P;
    return *this;
  }
  Mint &operator*=(const Mint &b) {
    v = LL(v) * b.v % P;
    return *this;
  }
  Mint &operator/=(const Mint &b) {
    return *this *= b.inv();
  }
  friend Mint operator+(Mint a, const Mint &b) {return a += b;}
  friend Mint operator-(Mint a, const Mint &b) {return a -= b;}
  friend Mint operator*(Mint a, const Mint &b) {return a *= b;}
  friend Mint operator/(Mint a, const Mint &b) {return a /= b;}
  Mint inv() const {return this->pow(P - 2);}
  Mint pow(LL b) const {
    Mint a = *this, c = 1;
    while (b) {
      if (b & 1) c *= a;
      a *= a;
      b /= 2;
    }
    return c;
  }
  friend ostream &operator<<(ostream &os, const Mint &a) {
    return os << a.v;
  }
};

vector<Mint> fac, ifac, inv;
void initFact(int n) {
  fac.resize(n + 1), ifac.resize(n + 1);
  inv.resize(n + 1);
  fac[0] = 1;
  for (int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i;
  ifac[n] = fac[n].inv();
  for (int i = n; i; i--) {
    ifac[i - 1] = ifac[i] * i;
    inv[i] = ifac[i] * fac[i - 1];
  }
}
inline Mint binom(int n, int m) {
  if (n < m || m < 0) return 0;
  return fac[n] * ifac[m] * ifac[n - m];
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  initFact(1e5);
  int m, n;
  cin >> m >> n;
  Mint ans = Mint(m) * binom(m - 1, n - 1);
  vector<array<Mint, 20>> f(m + 1);
  for (int i = 1; i <= m; i++) {
    f[i][1] = 1;
    for (int j = 2 * i; j <= m; j += i) {
      for (int k = 1; k + 1 < 20; k++) {
        f[j][k + 1] += f[i][k];
      }
    }
    for (int k = 1; k <= min(19, n); k++) {
      ans -= f[i][k] * binom(m / i - 1, n - k);
    }
  }
  cout << ans << "\n";
  return 0;
}