#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 998244353, maxn = 2e7 + 10;
int pr[maxn], cnt, pw[maxn], n, k, inv[maxn], s[maxn], sv[maxn];
bitset<maxn>isp;
inline int qmul(int a, int b){
	int res = a * b - (int)((long double)a / mod * b + 1e-8) * mod;
	return res < 0 ? res + mod : res;
}
int qpow(int a, int b) {
	int ret = 1;
	while (b) {
		if (b & 1)ret = qmul(ret, a);
		a = qmul(a, a); b >>= 1;
	}
	return ret;
}
void init() {
	isp.set();
	isp[0] = isp[1] = 0;
	pw[1] = 1;
	for (int i = 1; i < maxn; ++i) {
		if (isp[i]) {
			pw[i] = qpow(i, k);
			pr[cnt++] = i;
		}
		for (int j = 0; j < cnt && pr[j] * i < maxn; ++j) {
			isp[pr[j] * i] = 0;
			pw[pr[j] * i] = qmul(pw[pr[j]], pw[i]);
			if (i % pr[j] == 0) {
				break;
			}
		}
	}
	s[0] = 1;
	for (int i = 1; i <= n; ++i) s[i] = s[i - 1] * pw[i] % mod;
	sv[n] = qpow(s[n], mod - 2);
	for (int i = n; i >= 1; --i) sv[i - 1] = sv[i] * pw[i] % mod;
	for (int i = 1; i <= n; ++i) inv[i] = sv[i] * s[i - 1] % mod;

}
signed main() {
	cin >> n >> k;
	init();
	int fac = 1, ans = 0;
	for (int i = 1; i <= n; ++i) {
		fac = qmul(fac, i);
		(ans += qmul(fac, inv[i])) %= mod;
	}
	cout << ans;
	return 0;
}