#include<bits/stdc++.h>
using namespace std;
typedef  long long LL;
typedef pair<int,int> PII;
const int N=100010,M=1000010;
const int mod=998244353;
int INF = 1e9;
int h[N],e[M],ne[M],idx;
int T=1;
map<int,vector<int> > mp;
LL d[N],fd[N];
LL f[N][20];

LL qmi(LL a,LL k){
    LL res=1;
    while(k){
        if(k&1) res=res*a%mod;
        a=a*a%mod;
        k>>=1;
    }

    return res;
}

void init(int n){
    for(int i=1;i<=n;i++){
        for(int j=i+i;j<=n;j+=i){
            mp[j].push_back(i);
        }
    }

    d[0]=1,fd[0]=1;

    for(int i=1;i<=n;i++){
        d[i]=i*d[i-1]%mod;
        fd[i]=qmi(i,mod-2)*fd[i-1]%mod;
    }
}

LL get(int n,int m){
    if(m>n) return 0;
    return d[n]*fd[n-m]%mod*fd[m]%mod;
}


void solve(){
    int n,m;
    cin>>m>>n;
    init(N-1);
    LL res=0;
    for(int i=1;i<=m;i++){
        f[i][1]=1;
        LL t=m/i-1;
        res=(res+get(t,n-1))%mod;

        for(int k=2;k<20;k++){
            for(auto j:mp[i]){
                f[i][k]+=f[j][k-1];
                f[i][k]%=mod;
            }
            LL t=m/i-1;
            res+=f[i][k]*get(t,n-k);
        }
    }

    res=(n*get(m,n)%mod-res+mod)%mod;

    cout<<res<<endl;

}

    
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //int T=1;
    //cin>>T;
    while(T--) solve();
 
    return 0;
}