#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=100010;
ll mod=998244353;
ll fastpow(ll a,ll n)
{
    ll base=a;
    ll res=1ll;
    while(n)
    {
        if(n&1ll)res=(res*base)%mod;
        base=(base*base)%mod;
        n>>=1;
    }
    return res;
}
ll mod_inverse(ll x)
{
    ll res=fastpow(x,mod-2);
    return res;
}
ll dp[N][20];
int main()
{
    int n,m;
    scanf("%d %d",&m,&n);
    ll ans=0ll;
    ll c=1ll*m;
    for(int i=1;i<=m;i++)dp[i][1]=1ll;
    for(int i=1;i<=m;i++)
    {
        for(int j=1;j<=17;j++)
        {
            for(int k=2;k*i<=m;k++)
            {
                dp[k*i][j+1]=(dp[i][j]+dp[k*i][j+1])%mod;
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        c=(c*(m+1ll-i*1ll))%mod;
        c=(c*mod_inverse(i))%mod;
        if(i==n)ans=(ans+((i*1ll*c)%mod))%mod;
    }
    for(int i=1;i<=m;i++)
    {
        int b=(m/i)-1;
        int cc=1ll;
        if(n<=19)ans=(((ans-dp[i][n])%mod)+mod)%mod;
        for(int j=1;(j+1<=n)&&(j<=b);j++)
        {
            cc=(cc*(b*1ll+1ll-j*1ll))%mod;
            cc=(cc*mod_inverse(j))%mod;
            ll temp;
            if((n-j<=19)&&n-j>=1)temp=dp[i][n-j];
            else temp=0ll;
            ans=((ans-(((temp*cc)%mod))%mod)+mod)%mod;
        }
    }
    printf("%lld\n",ans);
    return 0;
}