#include <bits/stdc++.h>

#define ll long long
#define lll __int128

using namespace std;

namespace IO
{
	void read() {}
	template <typename T1, typename ...T2>
	void read(T1 &n, T2 &...m)
	{
		T1 op = 1;
		char c;
		while (isdigit(c = getchar()) == false)
			if (c == '-') op = -1;
		n = c ^ 48;
		while (isdigit(c = getchar()))
			n = (n << 1) + (n << 3) + (c ^ 48);
		n *= op;
		return read(m...);
	}
}

using IO::read;

namespace Solve
{
	const ll mod = 998244353;
	const int MaxN = 2e7, MaxP = 2e6;
	
	bitset<MaxN + 10> vis;
	ll f[MaxN + 10];
	int prm[MaxP + 10], cntp;
	
	ll qpow(ll n, ll k)
	{
		ll res = 1;
		while (k)
		{
			if (k & 1)
				res = (res % mod) * (n % mod) % mod;
			n = (n % mod) * (n % mod) % mod;
			k >>= 1;
		}
		return res;
	}
	
	void Sol()
	{
		ll n, k;
		read(n, k);
		f[1] = 1, vis[1] = true;
		ll frac = 1, ans = 1;
		for (int i = 2; i <= n; ++i)
		{
			if (vis[i] == false)
			{
				prm[++cntp] = i;
				f[i] = qpow(i, (mod - 2) * k);
			}
			frac *= i;
			frac %= mod;
			ans += frac * f[i] % mod;
			ans %= mod;
			for (int j = 1; j <= cntp && i * prm[j] <= n; ++j)
			{
				vis[i * prm[j]] = true;
				f[i * prm[j]] = (f[i] % mod) * (f[prm[j]] % mod) % mod;
				if (i % prm[j] == 0)
					break;
			}
		}
		printf("%lld\n", ans % mod);
	}
}

using Solve::Sol;

int main()
{
	Sol();
	return 0;
}