//Cut it out, you've already lost.
#include<bits/stdc++.h>
using namespace std;
const int maxn=500005,mod=998244353;
int n,m,T,ans,flg;
int a[maxn],fac[maxn],nfac[maxn],inv[maxn],d[maxn];
vector<int>f[maxn],dd[maxn];
inline void inc(int &x,int y){
	x+=y;
	if(x>=mod)
		x-=mod;
}
inline int C(int a,int b){
	return a<b? 0:1ll*fac[a]*nfac[b]%mod*nfac[a-b]%mod;
}
int main(){
	scanf("%d%d",&m,&n);
	fac[0]=fac[1]=nfac[0]=nfac[1]=inv[1]=1;
	for(int i=2;i<maxn;i++){
		fac[i]=1ll*fac[i-1]*i%mod;
		inv[i]=mod-1ll*(mod/i)*inv[mod%i]%mod;
		nfac[i]=1ll*nfac[i-1]*inv[i]%mod;
	}
	for(int i=1;i<=m;i++)
		for(int j=i;j<=m;j+=i){
			d[j]++;
			if(i!=j)
				dd[j].emplace_back(i);
		}
	for(int i=1;i<=m;i++){
		f[i].resize(d[i]+1);
		f[i][1]=1;
		for(int j=0;j<dd[i].size();j++){
			int x=dd[i][j];
			for(int k=1;k<=d[x];k++)
				inc(f[i][k+1],f[x][k]);
		}
		for(int j=1;j<=d[i]&&j<=n;j++)
			ans=(ans+1ll*f[i][j]*C(m/i-1,n-j))%mod;
	}
	ans=(1ll*C(m,n)*n-ans+mod)%mod;
	printf("%d\n",ans);
	return 0;
}