#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e5+5,mod=998244353;
int n,m,ans,len[M],fac[M],ifac[M],dp[M][20];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int qpow(int x,int n){
    int s=1; while (n){
        if (n&1) s=1ll*s*x%mod;
        x=1ll*x*x%mod; n>>=1;
    } return s;
}
int c(int n,int m){return n<m||m<0?0:1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}
int rdc(int x){return x>=mod?x-mod:x;}
int main(){
    m=read();n=read();
    for (int i=fac[0]=1;i<=m;i++) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[m]=qpow(fac[m],mod-2);
    for (int i=m;i;i--) ifac[i-1]=1ll*ifac[i]*i%mod;
    for (int i=1;i<=m;i++) dp[i][1]=len[i]=1;
    for (int i=1;i<=m;i++)
        for (int j=i<<1;j<=m;j+=i){
            len[j]=max(len[j],len[i]+1);
            for (int k=2;k<=len[j];k++)
                dp[j][k]=rdc(dp[j][k]+dp[i][k-1]);
        }
    for (int i=1;i<=m;i++)
        for (int j=1;j<=len[i];j++)
            ans=(ans+1ll*c(m/i-1,n-j)*dp[i][j])%mod;
    printf("%lld\n",(1ll*c(m,n)*n+mod-ans)%mod);
    return 0;
}