#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e5 + 5, M = 20, mod = 998244353;
int dp[N][M], fac[N], inv[N];
int qpow(int x, int y)
{
	int ans = 1;
	while(y)
	{
		if(y & 1)
			ans = (ll)ans * x % mod;
		x = (ll)x * x % mod;
		y >>= 1;
	}
	return ans;
}
void prep(int n)
{
	int i;
	fac[0] = 1;
	for(i = 1; i <= n; i++)
		fac[i] = (ll)fac[i - 1] * i % mod;
	inv[n] = qpow(fac[n], mod - 2);
	for(i = n; i >= 1; i--)
		inv[i - 1] = (ll)inv[i] * i % mod;
}
int C(int x, int y)
{
	return (x < y || y < 0) ? 0 : ((ll)fac[x] * inv[y] % mod * inv[x - y] % mod);
}

int main()
{
	int n, m, i, j, k, L = 18, ans = 0;
	scanf("%d%d", &m, &n);
	prep(m);
	dp[1][0] = 1;
	dp[1][1] = 1;
	for(i = 1; i <= m; i++)
		for(j = 2 * i; j <= m; j += i)
			for(k = 0; k < L; k++)
				dp[j][k + 1] = (dp[j][k + 1] + dp[i][k]) % mod;
	for(i = 1; i <= m; i++)
		for(j = 1; j <= L && j <= n; j++)
			ans = (ans + (ll)C(m / i - 1, n - j) * dp[i][j]) % mod;
	ans = ((ll)C(m, n) * n + mod - ans) % mod;
	printf("%d\n", ans);
	return 0;
}