#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define fixed(s) fixed<<setprecision(12)<<s
#define int long long
 
using namespace std;
 
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef long long ll;

const int N = 200010, mod = 998244353;

ll m, n;
ll fact[N], infact[N], inv[N];

ll C(ll a, ll b)
{
    if(a < b)return 0;
	return (ll)fact[a] * infact[b] % mod * infact[a - b] % mod;
}

void solve()
{
	cin >> m >> n;
	
	if(n == 1)
	{
		cout << 0;
		return;
	} 
	
	ll ans = 0;
	for(int i = 1; i <= m; i ++)
	{	
		int you = m / i - 1;
		ll res = C(you, n - 1);
		ans = (ans + res) % mod;
		//int cnt = 1;
		for(int j = i + i; j <= m; j += i)
		{
			ll beishu = j / i;
			int cnt = 2;
			ll num = j;

			while(num <= m)
			{
				if(cnt > n)break;
				int t_y = m / num - 1;
				res = C(t_y, n - cnt);
				ans = (ans + res) % mod;
				num *= beishu;
				cnt ++;
			}
		}
	}
	
	ll ans1 = C(m, n) * n % mod;
	ans = (ans1 - ans) % mod;
	cout << (ans + mod) % mod;
}

signed main()
{
	IOS
	
	fact[0] = fact[1]= infact[0] = infact[1] = inv[1] = 1;
	for(int i = 2; i < N; i ++)
	{
		fact[i] = ((ll)fact[i - 1] * i) % mod;
		inv[i] = (ll)(mod - mod / i) * inv[mod % i] % mod;
		infact[i] = (ll)infact[i - 1] * inv[i] % mod;
	}
	//cout << "===" << C(0, 0) << endl;
	
	int _ = 1;
	//cin >> _;
	while(_ --)
	{
		solve();
	}
	
	return 0;
}