#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const int mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
namespace math{
	const ll N = 1000000;
	ll fac[N+5],inv[N+5];
	void init(){
		fac[0]=inv[0]=1;
		for(ll i=1;i<=N;i++) fac[i]=fac[i-1]*i%mod;
		inv[N]=qpow(fac[N],mod-2);
		for(ll i=N-1;i>=1;i--) inv[i]=inv[i+1]*(i+1)%mod;
	}
	inline ll binom(ll x,ll y){
		if(x<0 || y<0 || x<y) return 0;
		return fac[x]*inv[y]%mod*inv[x-y]%mod;
	}
	inline ll perm(ll x,ll y){
		if(x<0 || y<0 || x<y) return 0;
		return fac[x]*inv[x-y]%mod;
	}
}
int n,m,dp[25][100005];

void procedure(){
	m=read(), n=read();
	if(n == 1 && m == 1){
		puts("0");
		return;
	}
	ll ans = n * math::binom(m, n) % mod;
	for(int i=1;i<=m;i++){
		dp[1][i] = (dp[1][i] + 1) % mod;

		for(int k=1; k<=17; k++){
			for(int j=2*i; j<=m; j+=i){
				(dp[k+1][j] += dp[k][i]) %= mod;
			}
		}
	}

	for(int i=1;i<=m;i++){
		for(int j=1; j<=17; j++)
		ans = (ans + (mod - dp[j][i]) * math::binom(m/i-1, n-j)) % mod;
	}

	printf("%lld\n", ans);
}
int main(){
	math::init();
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}