//Linkwish's code
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;typedef long double ld;typedef unsigned long long ull;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{
	
	ci N=100005,mod=998244353;
	
	si int qpow(int x,int y){
		int res=1;
		for(;y;x=1ll*x*x%mod,y>>=1)if(y&1)res=1ll*res*x%mod;
		return res;
	}

	int n,m;

	int fac[N],inv[N];
	si void init(){
		fac[0]=1;for(int i=1;i<=m;i++)fac[i]=1ll*fac[i-1]*i%mod;
		inv[m]=qpow(fac[m],mod-2);for(int i=m-1;~i;i--)inv[i]=1ll*inv[i+1]*(i+1)%mod;
	}
	si int C(int x,int y){return 1ll*fac[x]*inv[y]%mod*inv[x-y]%mod;}

	map<int,int> f[N];
	si int calc(int x,int y){
		if(y==1)return 1;
		if(f[x].count(y))return f[x][y];
		if(m/x<y)return 0;
		int res=C(m/x-1,y-1);
		for(int i=x+x;i<=m;i+=x)(res+=calc(i,y-1))%=mod;
		//cout<<"CALC "<<x<<' '<<y<<' '<<res<<endl;
		return f[x][y]=res;
	}

	void mian(){
		cin>>m>>n,init();
		int ans=1ll*C(m,n)*n%mod;
		//cout<<"INIT "<<ans<<endl;
		for(int i=1;i<=m;i++)(ans+=mod-calc(i,n))%=mod;
		cout<<ans<<endl;
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	assert(freopen("in.in","r",stdin));
	assert(freopen("out.out","w",stdout));
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	LinkWish::mian();
	return 0;
}