#include <bits/stdc++.h>

using namespace std;
using LL=long long;
const LL mod=998244353;

LL qpow(LL a,LL n)
{
	LL ans=1;
	while (n){
		if (n&1) ans=ans*a%mod;
		a=a*a%mod;
		n>>=1;
	}
	return ans;
}

int main()
{
	cin.tie(0)->sync_with_stdio(false);
	int _=1;
//	cin>>_;
	while (_--){
		LL n,m;
		cin>>n>>m;
		vector <vector <LL> > s(n+10,vector <LL> (20,0));
		for (int i=1;i<=n;i++){
			s[i][1]=1;
			for (int j=i*2;j<=n;j+=i){
				for (int k=1;k<20;k++){
					if (!s[i][k]) break;
					s[j][k+1]+=s[i][k];
					s[j][k+1]%=mod;
				}
			}
		}
		
		vector <LL> fp(n+10,1),dfp(n+10,1);
		for (int i=1;i<=n;i++){
			fp[i]=fp[i-1]*i%mod;
			dfp[i]=qpow(fp[i],mod-2);
		}
	
		auto C=[&](int a,int b) -> LL
		{
			if (a<b or a<0 or b<0) return 0ll;
			return fp[a]*dfp[b]%mod*dfp[a-b]%mod;
		};	//C(n,m)
		
		LL ans=C(n,m)*m%mod;
		ans=((ans-C(n-1,m-1))%mod+mod)%mod;
		for (int i=2;i<=n;i++){
			int t=n/i;
			for (int j=0;j<20;j++){
				ans=((ans-C(t-1,m-j)*s[i][j]%mod)%mod+mod)%mod;
			}
		}
		cout<<ans<<'\n';
	}
}