#include<bits/stdc++.h>
using namespace std;

namespace D {
	typedef long long ll;
	const int p = 998244353;
	const int N = 1e5 + 5;
	ll qp(ll a, ll b) {
        ll z = 1;
        while(b) {
            if(b & 1) z = 1ll * z * a % p;
            a %= p;
            a = a * a;
            a %= p;
            b >>= 1;
        }
        return z;
    }
	ll fac[N], ifac[N];
	ll C(int a, int b)  {
		if (a < b || b < 0) return 0;
		return (((fac[a] * ifac[b]) % p) * ifac[a - b]) % p;
	}
	unordered_map<int, map<int, ll> > nums;
	ll ans = 0;
	void work() {
		ll n, m;
		cin >> m >> n;
		fac[0] = 1;
		for (int i = 1; i < N; i++) fac[i] = (fac[i - 1] * i) % p;
		ifac[N - 1] = qp(fac[N - 1], p - 2);
		for (int i = N - 1; i; i--) ifac[i - 1] = (ifac[i] * i) % p;
		for (int i = 1; i <= m; i++) {
			nums[i][1] = 1;
		}
		for (int i = 1; i <= m; i++) {
			for (int j = 2 * i; j <= m; j += i) {
				for (auto it = nums[i].begin(); it != nums[i].end() && it->first < n; it++) {
					nums[j][it->first + 1] = (nums[j][it->first + 1] + it->second) % p;
				}
			}
		}
		ans = (C(m, n) * n) % p;
		for (int i = 1; i <= m; i++) {
			for (auto it = nums[i].begin(); it != nums[i].end(); it++) {
				ans = (((ans - it->second * C(m / i - 1, n - it->first)) % p) + p) % p;
			}
		}
		cout << ans << '\n';
	}
}
int main (void) {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	D::work();
	return 0;
}