#include <bits/stdc++.h>
using namespace std;
constexpr int P = 998244353, N = 2e5 + 5, LG = 20;
int fac[N], ifac[N], inv[N];
void init() {
	inv[1] = 1;
	for (int i = 2; i < N; i++) {
		inv[i] = 1ll * (P - P / i) * inv[P % i] % P;
	}
	for (int i = fac[0] = ifac[0] = 1; i < N; i++) {
		fac[i] = 1ll * fac[i - 1] * i % P;
		ifac[i] = 1ll * ifac[i - 1] * inv[i] % P;
	}
}
int binom(int x, int y) {
	if (y < 0 || y > x) return 0;
	return 1ll * fac[x] * ifac[y] % P * ifac[x - y] % P;
}
int m, n, f[N][LG];
int main() {
	init();
	cin >> m >> n;
	int ans = 1ll * n * binom(m, n) % P;
	for (int i = 1; i <= m; i++) {
		f[i][0] = 1;
		for (int k = 0; k + 1 < LG; k++) {
			for (int j = i * 2; j <= m; j += i) {
				(f[j][k + 1] += f[i][k]) %= P;
			}
		}
	}
	for (int i = 1; i <= m; i++) {
		for (int j = 0; j < LG; j++) {
			(ans -= 1ll * f[i][j] * binom(m / i - 1, n - j - 1) % P - P) %= P;
		}
	}
	cout << ans << "\n";
	return 0;
}