#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=998244353;

const int N=1e5+5;
int fac[N],infac[N];

int quick_pow(int a, int k, int p)
{
    int res = 1;
    while (k)
    {
        if (k & 1) res = res * a % p;
        a = a * a % p;
        k >>= 1;
    }
    return res;
}

int C(int a,int b){
    if(b>a) return 0;
    return fac[a] * infac[b] % mod * infac[a - b] % mod;
}

void pre() {
    fac[0]=infac[0]=1;
    for(int i=1;i<=100000;i++)
    {
        fac[i]=fac[i-1]*i%mod;
        infac[i]=infac[i - 1] * quick_pow(i,mod-2,mod)%mod;
    }
}


int dp[101010][20],n,m;

signed main(){
    pre();
    cin>>n>>m;

    int ans=C(n,m)*m%mod;

    for(int i=1;i<=n;i++){
        dp[i][1]=1;
        for(int k=1;k<20;k++)
            if(dp[i][k])
                for(int j=i*2;j<=n;j+=i)
                    (dp[j][k+1]+=dp[i][k])%=mod;

        for(int k=1;k<20;k++)
            if(dp[i][k])
                (ans-=dp[i][k]*C(n/i-1,m-k)%mod)%=mod;
    }

    cout<<(ans+mod)%mod;
}