#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
#define int long long
int n,m;

const int N=110000,P=998244353;
int quickpow(int a,int b){
    int ans=1,base=a;
    while(b){
        if(b&1)(ans*=base)%=P;
        (base*=base)%=P;
        b>>=1;
    }
    return ans;
}
int jc[N],inv[N];
void pre(int n){
    jc[0]=1;
    for(int i=1;i<=n;i++)jc[i]=jc[i-1]*i%P;
    for(int i=0;i<=n;i++)inv[i]=quickpow(jc[i],P-2);
}
int C(int a,int b){
    if(a<b)return 0;
    return jc[a]*inv[b]%P*inv[a-b]%P;
}
map<int,int> F[N];
int f(int n,int m){
    if(n>=m)return 0;
    if(F[n][m])return F[n][m];
    int ans=C(m-1,n)*n%P;
    for(int l=2,r;l<=m;l=r+1){
        r=m/(m/l);
        (ans+=(r-l+1)*f(n-1,m/l)%P-(r-l+1)*C(m/l-1,n-1)%P*n%P)%=P;
    }
    //cerr<<n<<' '<<m<<' '<<ans<<'\n';
    return F[n][m]=(ans+P)%P;
}
signed main(){
    int n,m;cin>>m>>n;pre(m);
    cout<<(f(n,m)+f(n-1,m))%P;
}