#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#define I inline
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 100010;
const int LG = 19;
int mul[N],inv[N],f[LG][N];
int n,m,red,ans;


int qpow(int x,int y) {
	if(y==0) return 1;
	if(y==1) return x;
	int mk=qpow(x,y/2);
	return y%2?mk*mk%mod*x%mod:mk*mk%mod;
}
I int C(int x,int y) {
	if(x<y) return 0;
	return mul[x]*inv[y]%mod*inv[x-y]%mod;
}
I void deal(int x) {
	for(int i=1;i*x<=m;++i) {
		int nxt=i*x;
		for(int pre=0;pre<=18;++pre) {
			int nd=n-pre-2,hv1=m/nxt-1,hv2=m/x-(nxt/x);
			if(hv2<nd||nd<0) continue;
			red+=f[pre][x]*(C(hv2,nd)-C(hv1,nd)+mod)%mod*(pre+1)%mod;
			red%=mod;
		}
		if(n<=18) {
			red+=f[n-1][x]*n%mod;
			red%=mod;
		}
	}
} 
signed main()
{
	{
		mul[0]=inv[0]=1;
		for(int i=1;i<=100000;++i) mul[i]=mul[i-1]*i%mod;
		inv[100000]=qpow(mul[100000],mod-2);
		for(int i=99999;i>=1;--i) inv[i]=inv[i+1]*(i+1)%mod;
	}
//	cout<<C(100000,99999)<<endl;
	for(int i=1;i<=100000;++i) {
		f[0][i]=1;
		for(int j=1;j<=18;++j) {
			for(int k=2;k*i<=100000;++k) {
				f[j][k*i]+=f[j-1][i];
				f[j][k*i]%=mod;
			}
		} 
	} 
	cin>>m>>n;
	for(int i=1;i<=m;++i) {
		deal(i);
	}
	cout<<(C(m,n)*n%mod-red+mod)%mod<<endl;
}