#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
constexpr int maxn = 2e5 + 7;
constexpr int mod = 998244353;
template<class T>
T power(T a, ll b) {
	T res = 1;
	for (; b; b >>= 1) {
		if (b & 1) {
			res = res * a;
		}
		a *= a;
	}
	return res;
}
ll powermod(ll a, ll b) {
	ll res = 1;
	for (; b; b >>= 1) {
		if (b & 1) {
			res = (res * a) % mod;
		}
		a = (a * a) % mod;
	}
	return res;
}
ll fac[maxn], invfac[maxn];
void init() {
	fac[0] = invfac[0] = 1;
	for (int i = 1; i < maxn; i++) {
		fac[i] = (fac[i - 1] * i) % mod;
	}
	invfac[maxn - 1] = powermod(fac[maxn - 1], mod - 2);
	for (int i = maxn - 2; i >= 0; i--) {
		invfac[i] = (invfac[i + 1] * (i + 1)) % mod;
	}
}
ll binom(int n, int m) {
	if (n < m or m < 0)return 0;
	return (fac[n] * invfac[m] % mod) * invfac[n - m] % mod;
}
ll del(ll a, ll b) {
	a -= b;
	if (a < 0)a += mod;
	return a;
}
std::vector<int> pr[maxn];
ll ff[maxn];
void solve() {
	ll n, m;
	cin >> n >> m;
	ll ans = (binom(n, m) * m) % mod;
	for (ll i = 1; i <= n; i++) {
		for (ll j = 2 * i; j <= n; j += i) {
			pr[j].pb(i);
			ff[i]++;
		}
	}
	std::vector dp(n + 1, std::vector<ll>());
	for (int i = 1; i <= n; i++) {
		dp[i].resize((ll)(pr[i].size() + 1));
		dp[i][0] = 1;
		for (auto q : pr[i]) {
			for(int j=0;j<dp[q].size();j++){
				dp[i][j+1]=(dp[i][j+1]+dp[q][j])%mod;
			}
		}
		for(int j=0;j<dp[i].size();j++){
			ans=del(ans,dp[i][j]*binom(ff[i],m-j-1)%mod);
		}
	}
	cout << ans;
}
int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	init();
	int t = 1;
	// cin>>t;
	while (t--)solve();
}