#include<bits/stdc++.h>
#define raed read
#define int long long
using namespace std;
const int MAXN = 200010,INF = 0x3f3f3f3f,mod = 998244353;
const double eps = 0.0001;
inline int read(){
	int X=0; bool flag=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') flag=0; ch=getchar();}
	while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
	if(flag) return X;return ~(X-1);
}
int n,m,T,f[MAXN],in[MAXN];
int cnt[MAXN][25];//以i为开头，长度为j的方案数
vector<int> e[MAXN];
int f_pow(int a,int b){
	int ans = 1;
	while(b){
		if(b&1) ans = (ans*a%mod)%mod;
		b>>=1;
		a = (a*a)%mod;
	}
	return ans%mod;
}
int Get(int a,int b){
	a%=mod;
	b%=mod;
	return (a*f_pow(b,mod-2))%mod;
}
int C(int a,int b){//a个里选b个 
	int x = f[a];
	int y = f[b]*f[a-b]%mod;
	return Get(x,y);
}
int Cnt(int x,int l,int r){//x在[l,r]里的倍数数量 
	return r/x-(l-1)/x;
}
void topsort(){
	queue<int> q;
	for(int i=1;i<=m;i++){
		cnt[i][1] = 1;
		if(!in[i]){
			q.push(i);
		}
	}
	while(!q.empty()){
		int v = q.front();
		q.pop();
		for(auto u:e[v]){
			in[u]--;
			if(!in[u]) q.push(u);
			for(int i=1;i<=20;i++){
				cnt[u][i]+=cnt[v][i-1];
				cnt[u][i]%=mod;
			}
		}
	}
}
signed main(){
	f[0] = 1;
	for(int i=1;i<=100000;i++){
		f[i] = f[i-1]*i;
		f[i]%=mod;
	} 
	cin>>m>>n;
	for(int i=1;i<=m;i++){
		for(int j=i*2;j<=m;j+=i){
			e[i].push_back(j);
			in[j]++;
		}
	}
	topsort();
	/*for(int i=1;i<=m;i++){
			for(int j=1;j<=4;j++) cout<<cnt[i][j]<<" ";
			cout<<endl;
	}*/
	int ans = 0;
	for(int i=1;i<=m;i++){
		int X = m-i,Y = Cnt(i,i+1,m);//随意 / 全是i的倍数 
		int ax = 0;
		int ay = 0;
		if(X>=n-1) ax = C(X,n-1);
		if(Y>=n-1) ay = C(Y,n-1);
		int az = (ax-ay+mod)%mod;
		ans+=(az*n)%mod;
		ans%=mod;
		for(int j=2*i;j<=m;j+=i){
			for(int len=1;len<=20;len++){
				if(!cnt[i][len]) continue;
				int X = Cnt(i,j+1,m),Y = Cnt(j,j+1,m);
				int ax = 0;
				int ay = 0;
				if(n-len-1<0) continue;
				if(X<n-len-1) continue;
				else ax = C(X,n-len-1);
				if(Y<n-len-1) ay = 0;
				else ay = C(Y,n-len-1);
				int az = (ax-ay+mod)%mod;
				az = az*cnt[i][len]%mod;
				az = az*(n-len)%mod;
				ans+=az;
				ans%=mod;
			}
		}
	}
	cout<<ans<<endl;
}
/*
11 4
4 3
7
6 4
49
*/