#include<bits/stdc++.h>
#define int __int128
using namespace std;
int read(){
	int s = 0, f = 1;char ch = getchar();
	while(!isdigit(ch)){if(ch == '-')f = -1;ch = getchar();}
	while(isdigit(ch)){s = s * 10 + ch - '0';ch = getchar();}
	return s * f;
}
void write(int x){
    if(x < 0){putchar('-'); x = -x;}
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
const int MAXN = 1e5 + 5, MOD = 998244353;
int n, m, ans, fac[MAXN], inv[MAXN], f[MAXN];
int fpow(int a, int b){
	int res = 1;
	while(b){
		if(b & 1ll)res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1ll;
	}
	return res;
}
int C(int a, int b){
	return fac[a] * inv[b] % MOD * inv[a - b] % MOD;
}
signed main(){
	m = read(), n = read();
	fac[0] = 1;
	for(int i = 1;i <= m;i ++)fac[i] = fac[i - 1] * i % MOD;
	inv[m] = fpow(fac[m], MOD - 2);
	for(int i = m - 1;i >= 0;i --)inv[i] = inv[i + 1] * (i + 1) % MOD;
	for(int i = 1;i <= m;i ++)f[i] = 1;
	ans = n * C(m, n);
	for(int t = 0;t < min(n, (int)17);t ++){
		int p = m / (n - t);
		for(int i = 1;i <= p;i ++)ans -= f[i] * C(m / i - 1, n - t - 1);
		if(t != min(n, (int)17) - 1){
			for(int i = m;i >= 0;i --){
				if(f[i]){
					for(int j = i * 2;j <= m;j += i){
						f[j] += f[i];
						f[j] %= MOD;
					}
					f[i] = 0;
				}
			}
		} 
	}
	write((ans % MOD + MOD) % MOD);
	return 0;
}