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

using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = l; i < r; i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

/* ---- */
#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, const auto &b) { return a > b ? a = b, 1 : 0; }
bool chmax(auto &a, const auto &b) { return a < b ? a = b, 1 : 0; }

struct IOSetup {
  IOSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template <class T>
void print(vector<T> a) {
  for (auto x : a) cerr << x << ' ';
  cerr << endl;
}

void print(auto x) { cerr << x << endl; }

template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cerr << head << ' ';
  print(forward<Tail>(tail)...);
}

const ll mod=998244353;

ll powll(ll x, ll k) {
  ll v = 1;
  while (k) {
    if (k & 1) v = v * x % mod;
    x = x * x % mod;
    k >>= 1;
  }
  return v;
}

int len=200000;
vll fac, finv;

void precalc() {
  fac.assign(len, 1), finv.assign(len, 1);
  rep2(i, 2, len) fac[i] = fac[i - 1] * i % mod;
  finv[len - 1] = powll(fac[len - 1], mod - 2);
  for (int i = len - 2; i >= 0; i--) finv[i] = finv[i + 1] * (i + 1) % mod;
}

ll binom(ll n, ll k) {
  if (n < 0 || k < 0 || k > n) return 0;
  // assert(n < len);
  return fac[n] * finv[k] % mod * finv[n - k] % mod;
}

ll inv(ll a) {
  // a = (a % mod + mod) % mod; // 必要なら
  if (a < len) return fac[a - 1] * finv[a] % mod;
  return powll(a, mod - 2);
}


int main(){
  precalc();
  int n,m;
  cin>>m>>n;
  int K=20;
  vector<vll>dp(K+1,vll(m+1,0));
  rep2(i,1,m+1)dp[1][i]=1;
  rep2(j,1,K-1){
    rep2(i,1,m+1){
      int now=2*i;
      while(now<=m){
        dp[j+1][now]+=dp[j][i];
        dp[j+1][now]%=mod;
        now+=i;
      }
    }
  }
  // rep2(i,1,K-1){
  //   rep2(j,1,m+1){
  //     int rem=(m/j)-1;
  //     dp2[i][j]=dp[i][j]%mod*binom(rem,n-i)%mod;
  //   }
  // }

  // rep2(i,1,4){
  //   print(dp2[i]);
  // }

  ll ans=0;
  ll ALL=binom(m,n);
  rep2(i,1,K-1){
    rep2(j,1,m+1){
      ll c=dp[i][j];
      int now=2*j;
      ll rem=c*binom((m/j)-1,n-i);
      rem%=mod;
      while(now<=m){
        rem-=c*binom((m/now)-1,n-(i+1));
        rem%=mod;
        now+=j;
      }
      ans+=rem*max(0LL,n-i);
      ans%=mod;
      ALL-=rem;
      ALL%=mod;
    }
  }
  ans+=ALL*n;
  ans%=mod;
  ans=(ans%mod+mod)%mod;
  cout<<ans<<endl;
}