#include <bits/stdc++.h>
using namespace std;
#define int long long

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

const int maxn = 1e5 + 5;
const int mod = 998244353;
int fac[maxn],inv[maxn],dp[maxn][25];

int C(int n,int m) {
	if (n < m) return 0;
	return fac[n] * inv[m] % mod * inv[n - m] % mod;
}

int ADD(int a,int b) {
	return (a + b) % mod;
}

int qmi(int a,int b) {
	int res = 1;
	while (b) { 
		if (b & 1) res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res % mod;
}

void init() {
	for (int i = 1;i <= 1e5;i++) dp[i][1] = 1;
	for (int k = 2;k <= 20;k++) {
		for (int i = 1;i <= 1e5;i++) {
			for (int j = i * 2;j <= 1e5;j += i) {
				dp[j][k] = ADD(dp[j][k],dp[i][k - 1]);
			}
		}
	}
	fac[0] = inv[0] = 1;
	for (int i = 1;i <= maxn;i++) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = qmi(fac[i],mod - 2);
	}
}

void GENSHEN_START() {
	int n,m;cin >> m >> n;
	int ans = C(m,n) * n % mod;
	vector <int> over(m + 1);
	for (int i = 1;i <= m;i++) {
		for (int j = i * 2;j <= m;j+=i) {
			over[i]++;
		}
	}
	for (int i = 1;i <= m;i++) {
		for (int j = 1;j <= 20;j++) {
			int val = 0;
			if (n - j >= 0) val = dp[i][j] * C(over[i],n - j) % mod;
			ans = (ans - val + mod) % mod;
		}
	}
	cout << ans << '\n';
}	

signed main()
{
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	init();
	//cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}