// #ifdef local
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #endif
//  #pragma comment(linker, "/STACK:102400000,102400000")

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#ifndef local
#define endl '\n'
#endif

#define pb emplace_back
#define fi first
#define se second
#define rep(i, l, r) for (long long i = l; i <= r; i++)
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double db;
// typedef double db;
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;
typedef pair<double, double> PD;
const double pi = acos(-1);
typedef __int128_t int128;
const db eps = 1e-9;
std::mt19937_64 rng(time(0));
ll my_random(ll l, ll r)
{
	uniform_int_distribution<int> range(l, r);
	return range(rng);
}
void __()
{
#ifdef local
	system("pause");
#endif
}
ll qp(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b)
	{
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}
const int INF = 0x3f3f3f3f;
const int maxn = 2e5 + 10;
const ll mod = 998244353;
int m, n;
ll fac[maxn], inv[maxn];
ll C(ll n, ll m)
{
	return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
vector<vector<ll>> vec(maxn, vector<ll>(20));

void init(int n)
{
	for (int i = 1; i <= n; i++)
		vec[i][1] = 1;
	for (int i = 1; i <= n; i++)
		for (int j = 2 * i; j < maxn; j += i)
			for (int k = 0; k < 19; k++)
			{
				vec[j][k + 1] = (vec[j][k + 1] + vec[i][k] > mod ? vec[j][k + 1] + vec[i][k] - mod : vec[j][k + 1] + vec[i][k]);
			}
}
int main()
{
	IOS;
	fac[0] = inv[0] = 1;
	for (int i = 1; i < maxn; i++)
	{
		fac[i] = 1ll * fac[i - 1] * i % mod;
		inv[i] = qp(fac[i], mod - 2, mod);
	}
	cin >> m >> n;
	init(m);
	ll ans = n * C(m, n) % mod;
	//cout<< ans <<endl;
	for (int i = 1; i <= m; i++)
	{
		int remain = m / i - 1;
		for (int j = 1; j < 20; j++)
		{
			int remain2 = n - j;
			if (remain2 < 0 || remain2 > remain)
				continue;
			//cout<<i<<" "<<j <<" "<< remain2<<endl;
			ans -= 1ll * vec[i][j] * C(remain, remain2) % mod;
			ans = (ans % mod + mod) % mod;
		}
	}
	cout << ans << endl;
	__();
	return 0;
}