#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define sz(a) ((int)((a).size()))
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()

typedef long long li;
typedef long double ld;

const li INF64 = (li)(1e18);
const int INF = (int)(1e9);

using namespace std;

const int MOD = 998244353;

int m, n;

bool read()
{
	if(!(cin >> m >> n))
	{
		return false;
	}	
	return true;
}

int add(int a, int b){
	a += b;
	if (a >= MOD)
		a -= MOD;
	if (a < 0)
		a += MOD;
	return a;
}

int mul(int a, int b){
	return a * 1ll * b % MOD;
}

int binpow(int a, int b){
	int res = 1;
	while (b){
		if (b & 1)
			res = mul(res, a);
		a = mul(a, a);
		b >>= 1;
	}
	return res;
}

vector<int> fact, rfact;

int cnk(int n, int k){
	if (k < 0 || n < 0 || k > n) return 0;
	return mul(fact[n], mul(rfact[k], rfact[n - k]));
}

void solve()
{
	fact.resize(m + 1);
	fact[0] = 1;
	fore(i, 1, m + 1) fact[i] = mul(fact[i - 1], i);
	rfact.resize(m + 1);
	rfact[m] = binpow(fact[m], MOD - 2);
	for (int i = m - 1; i >= 0; --i)
		rfact[i] = mul(rfact[i + 1], i + 1);
	
	vector<vector<int>> dp(m + 1, vector<int>(20, 0));
	fore(i, 1, m + 1) dp[i][1] = 1;
	for (int j = 1; j + 1 < 20; ++j) for (int i = 1; i <= m; ++i) for (int k = 2 * i; k <= m; k += i)
		dp[k][j + 1] = add(dp[k][j + 1], dp[i][j]);
	
	int ans = 0;
	fore(i, 1, m + 1) fore(j, 1, 20){
		ans = add(ans, mul(dp[i][j], cnk(m / i - 1, n - j)));
	}
	cout << add(mul(cnk(m, n), n), -ans) << '\n';
}

int main(){
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#endif
	cin.tie(0);
	ios::sync_with_stdio(false);
	int tc = 1;
	// cin >> tc;
	while(tc > 0)
	{
		--tc;
		read();
		solve();
	}
}