#include <bits/stdc++.h>
const int mod = 998244353;
void solve() {
	int m, n;
	std::cin >> m >> n;

	auto q_pow = [&] (int x, int p, int mod) {
		int ret = 1;
		while(p) {
			if(p & 1) {
				ret = (1ll * ret * x) % mod;
			}
			x = (1ll * x * x) % mod;
			p >>= 1;
		}
		return ret;
	};
	std::vector<int> fac(m + 1);
	std::vector<int> inv_fac(m + 1);
	fac[0] = 1;
	for (int i = 1; i <= m; ++i) {
		fac[i] = (1ll * fac[i - 1] * i) % mod;
	}
	inv_fac[m] = q_pow(fac[m], mod - 2, mod);
	for (int i = m; i >= 1; --i) {
		inv_fac[i - 1] = (1ll * inv_fac[i] * i) % mod;
	}
	auto C = [&] (int n, int m) {
		if(n < m) {
			// return 0ll;
			return 0ll;
		}
		int tmp_up = fac[n];
		int tmp_down = (1ll * inv_fac[m] * inv_fac[n - m]) % mod;
		return (1ll * tmp_up * tmp_down) % mod;
	};

	std::vector<std::vector<int>> dp(m + 1, std::vector<int>(20));
	for (int i = 1; i <= m; ++i) {
		dp[i][1] = 1;
		for (int j = 1; j * j <= i && j < i; ++j) {
			if(i % j == 0) {
				int tmp = i / j;
				for (int k = 2; k <= 17; ++k) {
					if (dp[j][k - 1] > 0) {
						dp[i][k] += dp[j][k - 1];
					}
				}
				if (tmp > j && tmp < i) {
					for (int k = 2; k <= 17; ++k) {
						if (dp[tmp][k - 1] > 0) {
							dp[i][k] += dp[tmp][k - 1];
						}
					}
				}
			}
		}
	}
	int ans = (1ll * n * C(m, n)) % mod;
	for (int i = 1; i <= m; ++i) {
		int tmp = 0;
		for (int k = 1; k <= 17 && k <= n; ++k) {
			// printf("{%d, %d} = %d\n", i, k, dp[i][k]);
			tmp = (0ll + tmp + 1ll * dp[i][k] * C(m / i - 1, n - k)) % mod;
		}
		// printf("tmp = %d, ans = %d\n", tmp, ans);
		ans = (0ll + mod + ans - tmp) % mod;
	}
	std::cout << ans << "\n";
	return;
}
int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	// std::cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}