#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;

const ll MAX = 300000;
ll fac[MAX];
ll inv[MAX];

ll modpow(ll a, ll b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		ll t = modpow(a, b/2);
		t *= t;
		t %= mod;
		return t;
	}
	ll t = modpow(a, b-1);
	t *= a;
	t %= mod;
	return t;
}

ll C(ll n, ll k){
	if(n < k)return 0;
	ll ret = fac[n];
	ret *= inv[n-k];
	ret %= mod;
	ret *= inv[k];
	ret %= mod;
	return ret;
}

int main(){
	fac[0] = 1;
	for(int i = 1; i <= MAX; i++){
		fac[i] = fac[i-1] * i;
		fac[i] %= mod;
	}
	inv[MAX-1] = modpow(fac[MAX-1] , mod-2);
	for(int i = MAX-2; i >= 0; i--){
		inv[i] = inv[i+1] * (i+1);
		inv[i] %= mod;
	}
	ll N,M; cin >> M >> N;
	vector<map<ll,ll>> dp(M+1);
	for(int i = 1; i <= M; i++){
		dp[i][1] = 1;
		for(int j = i*2; j <= M; j += i){
			for(auto p:dp[i]){
				int len = p.first;
				ll value = p.second;
				dp[j][len+1] += value;
				dp[j][len+1] %= mod;
			}
		}
	}
	ll ans = C(M, N);
	ans *= N;
	ans %= mod;
	for(int i = 1; i <= M; i++){
		ll B = M / i - 1;
		for(auto p:dp[i]){
			ll A = p.first;
			if(N-A < 0)continue;
			ll value = p.second;
			ll add = mod - C(B , N-A);
			add *= p.second;
			add %= mod;
			ans += add;
			ans %= mod;
		}
	}
	cout << ans << endl;
}