#include <bits/stdc++.h>
using namespace std;
const int N = 2e7 + 5,p = 998244353;
int n,k,tot,sum,inv[N],fac[N],mi[N],pr[N];
bool f[N];
int ksm(int x,int y)
{
	int ret = 1;
	while(y)
	{
		if(y & 1) ret = 1LL * ret * x % p;
		x = 1LL * x * x % p;
		y >>= 1;
	}
	return ret;
}
int main()
{
	scanf("%d%d",&n,&k);
	inv[1] = fac[1] = mi[1] = sum = 1;
	for(int i = 2;i <= n;i++)
	{
		inv[i] = p - 1LL * (p / i) * inv[p % i] % p;
		fac[i] = 1LL * fac[i - 1] * i % p;
		if(!f[i])
		{
			mi[i] = ksm(inv[i],k);
			pr[++tot] = i;
		}
		sum = (sum + 1LL * fac[i] * mi[i] % p) % p;
		for(int j = 1;j <= tot && pr[j] * i <= n;j++)
		{
			mi[i * pr[j]] = 1LL * mi[i] * mi[pr[j]] % p;
			f[i * pr[j]] = 1;
			if(i % pr[j] == 0) break;
		}
	}
	printf("%d\n",sum);
	return 0;
}