#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define all(a) a.begin(), a.end()
#define rep(i, a, b) for(ll i = a; i < b; i++)
#define per(i, a, b) for(ll i = b-1; i >= a; i--)
const ll mod = 998244353;

ll mod_pow(ll a,ll x) {
    ll res = 1;
    while(x > 0){
        if(x & 1) res = res * a % mod;
        a = a * a % mod;
        x >>= 1;
    }
    return res;
}



int L = 500'000;
vector<ll> fact;
vector<ll> finv;
void init(){
    fact.resize(L+1, 1);
    finv.resize(L+1, 1);

    rep(i, 1, L+1){
        fact[i] = fact[i-1] * (i) % mod;
    }
    finv[L] = mod_pow(fact[L], mod-2);
    per(i, 0, L){
        finv[i] = finv[i+1] * (i+1) % mod;
    }
}

ll nCr(ll n, ll r){
    if(n < r) return 0;
    if (n < 0 || r < 0) return 0;
    return fact[n] * finv[r] % mod * finv[n-r] % mod;
}


void solve(){
    init();
    ll m,n;
    cin >> m >> n;
    vector<vector<ll>> cant(m+1, vector<ll>(25, 0));
    rep(i, 1, m+1){
        cant[i][1] = 1; 
    }

    ll res = 0;

    rep(i, 1, m+1){
        ll mn = 1e9;
        rep(j, 0, 25){
            res = (res + nCr(m/i-1, n-j) * cant[i][j]) % mod;
        }
        if(mn != 0){
            for(ll j = i * 2; j <= m; j += i){
                rep(k, 0, 24){
                    cant[j][k+1] = (cant[j][k+1] + cant[i][k]) % mod;
                }
            }
        }
    }

    cout << (nCr(m, n) * n % mod - res + mod) % mod << endl;
}

int main(){
    int t = 1;
    while(t--){
        solve();
    }
}