#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) (x).begin(), (x).end()

const int mod = 998244353;

int add(int x) {
  return x;
}

template<typename... T>
int add(int x, T... y) {
  x += add(y...);
  if (x >= mod)
    x -= mod;
  return x;
}

template<typename... T>
int udd(int &x, T... y) {
  return x = add(x, y...);
}

template<typename... T>
int sub(int x, T... y) {
  return add(x, mod - add(y...));
}

int mul(int x) {
  return x;
}

template<typename... T>
int mul(int x, T... y) {
  return 1ll * x * mul(y...) % mod;
}

int bin(int x, int to) {
  int y = 1;
  while (to) {
    if (to & 1) {
      y = mul(x, y);
    }
    to >>= 1;
    x = mul(x, x);
  }
  return y;
}

int inv(int x) {
  assert(x != 0);
  return bin(x, mod - 2);
}

const int M = 100300;
const int A = 20;

int fact[M], ifact[M];

int binom(int n, int k) {
  if (n < 0 || k < 0 || n < k)
    return 0;
  return mul(fact[n], ifact[n - k], ifact[k]);
}

void precalc() {
  fact[0] = 1;
  for (int i = 1; i < M; ++i) {
    fact[i] = mul(i, fact[i - 1]);
  }
  for (int i = 0; i < M; ++i)
    ifact[i] = inv(fact[i]);
}

int d[A][M];

void pre() {
  fill(d[1], d[1] + M, 1);

  for (int j = 1; j + 1 < A; ++j)
    for (int i = 1; i < M; ++i) {
      for (int t = 2 * i; t < M; t += i)
        udd(d[j + 1][t], d[j][i]);
    }

}


int main() {
#ifndef ONLINE_JUDGE
  freopen("f.txt", "r", stdin);
#endif
  ios_base::sync_with_stdio(false);

  precalc();
  pre();

  int n, m;
  cin >> m >> n;

  int ans = mul(n, binom(m, n));
  for (int j = 1; j < A && j <= n; ++j)
    for (int x = 1; x <= m; ++x) {
      int bon = d[j][x];
      if (n > j)
        bon = mul(bon, binom((m / x) - 1, n - j));

//      cerr << "len = " << j << " pivot = " << x << " cnt ways = " << d[j][x] << " total = " << bon << "\n";

      ans = sub(ans, bon);
    }

  cout << ans << "\n";

  return 0;
}