#include <bits/stdc++.h>

#define int long long
using namespace std;
const int mod = 998244353;
const int N = 1e5 + 5;
int fac[N], inv[N];
int fc[21][N];
int qmi(int a, int b) {
    a %= mod;
    int res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
void init() {
    fac[0] = inv[0] = fac[1] = inv[1] = 1;
    for (int i = 2; i < N; i++) fac[i] = i * fac[i - 1] % mod;
    inv[N - 1] = qmi(fac[N - 1], mod - 2ll);
    for (int i = N - 2; i > 1; i--) inv[i] = (int)(i + 1) * inv[i + 1] % mod;
    for(int i=1;i<N;i++){
        fc[1][i]=1;
        for(int j=1;j<20;j++){
            if(!fc[j][i])continue;
            for(int k=i+i;k<N;k+=i)
                fc[j+1][k]+=fc[j][i];
        }
    }
}
int C(int a, int b) {
    if(b==0||b==a)return 1;
    if(b>a)return 0;
    return fac[a] * inv[a - b] % mod * inv[b] % mod;
}
void solve() {
    int m,n;
    cin>>m>>n;
    int ans=n*C(m,n)%mod;
    for(int i=1;i<=m;i++){
        int b=m/i-1ll;
        for(int j=1;j<=min(20ll,n);j++){
            int sub=fc[j][i] * C(b,n-j) %mod;
            ans=(ans-sub+mod)%mod;
        }
    }
    cout<<ans<<"\n";
}
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    init();
    int t = 1;
    // std::cin >> t;
    for (int i = 0; i < t; ++i) {
        solve();
    }

    return 0;
}