#include<bits/stdc++.h>
#define int long long
#define eb emplace_back
#define mp make_pair
#define DEBUG
using namespace std;
using pii = pair<int, int>;
using piii = pair<int, pii>;
using piiii = pair<pii, pii>;
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned int;
const int P = 998244353;const i64 inf = 0x3f3f3f3f3f3f3f3f;
namespace CombineMath{
	// const int P = ...;
	vector<int> jc;
	vector<int> inv;
	int ksm(int u, int v){
		int ret = 1;
		while(v){
			if(v & 1) ret = 1ll * ret * u % P;
			u = 1ll * u * u % P, v >>= 1;
		}
		return ret;
	}
	int prework(int n){
		jc.assign(n + 5, 0);
		inv.assign(n + 5, 0);
		jc[0] = 1, inv[0] = 1;
		for(int i = 1; i <= n; i ++)
			jc[i] = 1ll * jc[i - 1] * i % P;
		inv[n] = ksm(jc[n], P - 2);
		for(int i = n - 1; i >= 1; i --)
			inv[i] = 1ll * inv[i + 1] * (i + 1) % P;
		return 0;
	}
	int binom(int u, int v){
		if(u < 0 || v < 0) return 0;
		if(u < v) return 0;
		return 1ll * (1ll * jc[u] * inv[v] % P) * inv[u - v] % P;
	}
	int F(int u, int v){
		return binom(u + v - 1, v - 1);
	}
}using namespace CombineMath;
namespace azus{
	int n, m;
	int f[100005][25];
	int main(){
		cin >> m >> n;
		for(int i = 1; i <= m; i ++){
			f[i][1] ++;
			for(int j = i + i; j <= m; j += i){
				for(int k = 1; k <= 24; k ++){
					(f[j][k] += f[i][k - 1]) %= P;
				}
			}
		}
		int ans = 0;
		for(int i = 1; i <= m; i ++){
			for(int j = 1; j <= 24; j ++){
				int len = n - j;
				int x = m / i - 1;
				(ans += f[i][j] * binom(x, len) % P) %= P;
			}
		}
		cout << ((n * binom(m, n) % P) - ans + P) % P << "\n";
		return 0;
	}
}
signed main(){
#ifndef DEBUG
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
#endif
	int T = 1;
	CombineMath::prework(1000005);
	// cin >> T;
	while(T --)
		azus::main();
	return 0;
}