#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
#define maxn 100005
#define fopen(x, y) freopen(x".in", "r", stdin); freopen(y".out", "w", stdout);
#define int long long
#ifdef int
#define inf 0x3f3f3f3f3f3f3f3fll
#else
#define inf 0x3f3f3f3f
#endif

using namespace std;

const int mod = 998244353;

int n, m, fac[maxn], ifac[maxn], inv[maxn], c[maxn], d[maxn], f[maxn][20];

int C(int x, int y) {
	return (y < 0 || y > x) ? 0 : fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}

void work() {
	cin >> m >> n;
	for(int i = 1; i <= m; i++) {
		f[i][0] = 1;
		for(int j = (i << 1); j <= m; j += i) {
			d[j]++, c[i]++;
			for(int p = 0; p <= 16; p++) {
				f[j][p + 1] = (f[j][p + 1] + f[i][p]) % mod;
			}
		}
	}
	int ans = C(m, n) * n % mod;
	for(int i = 1; i <= m; i++) {
//		cout << ans << endl;
		for(int j = 0; j <= min(n - 1, c[i]); j++) {
			if(n - 1 - j > 16) continue;
			(ans -= C(c[i], j) * f[i][n - 1 - j]) %= mod;
		}
	}
	cout << (ans + mod) % mod << '\n';
}

signed main() {
	fac[0] = ifac[0] = inv[1] = fac[1] = ifac[1] = 1;
	for(int i = 2; i <= 100000; i++) {
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		fac[i] = fac[i - 1] * i % mod;
		ifac[i] = ifac[i - 1] * inv[i] % mod;
	}
	ios::sync_with_stdio(false); cin.tie(0);
	int _ = 1;
//	cin >> _;
	while(_--) work();
}