#include<bits/stdc++.h>
#define FIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
using namespace std;
const int N=1e6+5;
const int mod=998244353;

static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int wrd(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void write(int x){static char buf[20];static int len=-1;if(x<0)putchar('-'),x=-x;do buf[++len]=x%10,x/=10;while(x);while(len>=0)putchar(buf[len--]+48);}

int qpw(int a,int b){
	int as=1;
	while(b){
		if(b&1) as=1ll*as*a%mod;
		a=1ll*a*a%mod,b>>=1;
	}
	return as;
}
void ad(int &a,int b){(a+=b)>=mod&&(a-=mod);}

int n,m,as,fac[N],inv[N],pr[N],cnt;
bool vs[N];

void init(int n){
	fac[0]=1; for(int i=1;i<=n;++i) fac[i]=1ll*fac[i-1]*i%mod;
	inv[n]=qpw(fac[n],mod-2); for(int i=n;i;--i) inv[i-1]=1ll*inv[i]*i%mod;
	for(int i=2;i<=n;++i){
		if(!vs[i]) pr[++cnt]=i;
		for(int j=1;j<=cnt&&i*pr[j]<=n;++j){
			vs[i*pr[j]]=1;
			if(i%pr[j]==0) break;
		}
	}
}
int C(int n,int m){
	if(n<m || m<0) return 0;
	return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}

int f[N],g[N];

signed main(){
	m=wrd(),n=wrd(),init(N-5);
	int len=min(n,(int)log2(m)+1);
	for(int i=1;i<=m;++i) f[i]=1,ad(as,C(m/i-1,n-1));
	
	for(int k=2;k<=len;++k){
		for(int i=1;i<=m;++i) g[i]=f[i];
		for(int j=1;j<=cnt&&pr[j]<=m;++j){
			for(int i=1;i*pr[j]<=m;++i) ad(g[i*pr[j]],g[i]);
		}
		for(int i=1;i<=m;++i){
			f[i]=(g[i]-f[i]+mod)%mod;
			ad(as,1ll*f[i]*C(m/i-1,n-k)%mod);
		}
	}
	as=(1ll*n*C(m,n)%mod-as+mod)%mod;
	write(as);
}