#include<bits/stdc++.h>
using namespace std;bool Mbe;
namespace MAOJUN{

typedef long long ll;
const int N=1e5+5,MOD=998244353;
int n,m;
inline ll ksm(ll x){ll r=1;for(int y=MOD-2;y;y>>=1,x=x*x%MOD)if(y&1)r=r*x%MOD;return r;}
ll F[N],I[N];
inline ll C(int n,int m){return n<m?0:F[n]*I[m]%MOD*I[n-m]%MOD;}

vector<int>pr[N];
inline void ad(int&x,int y){x+=y;x>=MOD&&(x-=MOD);}
int dp[N][30];
inline void main(){
	scanf("%d%d",&m,&n);
	F[0]=1;for(int i=1;i<N;i++)F[i]=F[i-1]*i%MOD;
	I[N-1]=ksm(F[N-1]);for(int i=N-2;~i;i--)I[i]=I[i+1]*(i+1)%MOD;
	for(int i=1;i<N;i++)for(int j=i*2;j<N;j+=i)pr[j].emplace_back(i);
	for(int i=1;i<N;i++){
		dp[i][0]=1;
		for(int p:pr[i])for(int j=1;j<30;j++)
			ad(dp[i][j],dp[p][j-1]);
	}
	ll rs=C(m,n)*n%MOD;
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n&&dp[i][j-1];j++)
			rs=(rs-dp[i][j-1]*C(m/i-1,n-j))%MOD;
	printf("%lld\n",(rs+MOD)%MOD);
}

}bool Med;int main(){
#ifdef LOCAL
	freopen("3.in","r",stdin);
	freopen("data.out","w",stdout);
#endif
	MAOJUN::main();
#ifdef LOCAL
	fprintf(stderr,"%lfs\n",clock()/1000.);
	fprintf(stderr,"%lfMB\n",(&Mbe-&Med)/1024./1024);
#endif
	return 0;
}