#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5,mod=998244353;
int fac[N],inv[N],n,m;
int power(int a,int b){int res=1;for(;b;b>>=1){if(b&1)res=1ll*res*a%mod;a=1ll*a*a%mod;}return res;}
void init()
{
	fac[0]=1;for(int i=1;i<N;i++)fac[i]=1ll*fac[i-1]*i%mod;
	inv[N-1]=power(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--)inv[i]=1ll*inv[i+1]*(i+1)%mod;
}
int c(int x,int y){if(x<0 || y<0 || x<y)return 0;return 1ll*fac[x]*inv[y]%mod*inv[x-y]%mod;}
int d[N];
vector<int>g[N],f[N];
int h[N][21],h1[N][21];
void calc(int len)
{
	if(g[len].size())return ;
	g[len].resize(len+1);
	for(int i=1;i<=len;i++)
	{
		g[len][i]=c(len,i);
		for(int j=1;j<=len;j++)
		{
			if(len/j-1>=i-1)g[len][i]=(g[len][i]-c(len/j-1,i-1)+mod)%mod;
			else break;
		}
	}
}
vector<int>sd[N];
int main()
{
	// freopen(".in.txt","r",stdin);
	init();
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)for(int j=i;j<=n;j+=i)d[j]++,sd[j].push_back(i);
	for(int i=1;i<=n;i++)calc(n/i);
	for(int i=1;i<=n;i++)
	{
		h[i][1]=1;
		for(auto j:sd[i])if(j!=i)for(int k=2;k<=20;k++)h[i][k]=(h[i][k]+h[j][k-1])%mod;
	}
	for(int i=1;i<=n;i++)
	{
		h1[i][0]=1;
		for(auto j:sd[i])for(int k=1;k<=20;k++)h1[i][k]=(h1[i][k]+h[j][k])%mod;
	}
	int ans=0;
	for(int i=n;i>=1;i--)
	{
		int num=n/i-1;
		f[i].resize(num+2);
		int res=0;
		for(int j=1;j<=min(m,num);j++)
		{
			f[i][j]=1ll*g[n/i][j]*j%mod;
			for(int k=i*2;k<=n;k+=i)
			{
				if(j>=f[k].size())break;
				f[i][j]=(f[i][j]-f[k][j]+mod)%mod;
			}
			if(m-j<=20)
			{
				// cout<<i<<" "<<m-j<<" "<<h[i][m-j]<<" "<<f[i][j]<<" "<<c(d[i],m-j)<<endl;
				ans=(ans+1ll*f[i][j]*h1[i][m-j])%mod;
			}
			// res=(res+1ll*f[i][j]*c(d[i],m-j))%mod;
		}
		// cout<<i<<" "<<res<<endl;
	}
	printf("%d\n",ans);
	return 0;
}