// 長い夜の終わりを信じながら
// Think twice, code once.
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

const int mod = 998244353;

int m, n, fac[100005], inv[100005], dp[100005][17];
vector<int> d[100005];

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

int main() {
	scanf("%d%d", &m, &n);
	fac[0] = fac[1] = 1;
	inv[0] = inv[1] = 1;
	for (int i = 2; i <= m; i++) {
		fac[i] = (long long)fac[i - 1] * i % mod;
		inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod;
	}
	for (int i = 2; i <= m; i++) inv[i] = (long long)inv[i - 1] * inv[i] % mod;
	int ans = (long long)C(m, n) * n % mod;
	for (int i = 1; i <= m; i++) {
		for (int j = i + i; j <= m; j += i) d[j].push_back(i);
		dp[i][1] = 1;
		for (int j = 2; j < 17; j++)
			for (int k : d[i]) dp[i][j] = (dp[i][j] + dp[k][j - 1]) % mod;
		for (int j = 1; j < 17; j++)
			if (j <= n)
				ans = (ans - (long long)dp[i][j] * C(m / i - 1, n - j) % mod + mod) % mod;
	}
	printf("%d\n", ans);
	return 0;
}