#include<bits/stdc++.h>
using namespace std;
const int mod = 998244353,maxn = 2e7 + 10;
int sq(int x,int m){
	return 1ll * x * x % m;
}
int qp(int a,int k,int m){
	if(!k)return 1;
	int t = sq(qp(a,k >> 1,m),m);
	if(k & 1)return 1ll * t * a % m;
	return t;
}
bool num[maxn];
int prime[maxn],sm[maxn],cnt,t[maxn],s[maxn],sv[maxn],inv[maxn];
inline int read(){
    char c = getchar();
    while(c < '0' || c > '9')c = getchar();
    int a = 0;
    while(c >= '0' && c <= '9'){
        a = a * 10 + c - '0';
        c = getchar();
    }
    return a;
}
void write(int n){
    if(!n)return;
    write(n / 10);
    putchar(n % 10 + '0');
}
int main(){
	int n = read(),k = read();
	for(int i = 2;i <= n;i++){
		if(!num[i])prime[++cnt] = i;
		for(int j = 1;j <= cnt && i * prime[j] <= n;j++){
            num[i*prime[j]] = 1;
            sm[i*prime[j]] = prime[j];
            if(!(i % prime[j]))break;
        }
	}
	for(int i = 1;i <= n;i++)
		if(!num[i])t[i] = qp(i,k,mod);
		else t[i] = 1ll * t[sm[i]] * t[i/sm[i]] % mod;
	s[0] = 1;
	for(int i = 1;i <= n;i++)
		s[i] = 1ll * s[i - 1] * t[i] % mod;
	sv[n] = qp(s[n],mod - 2,mod);
	for(int i = n;i >= 1;i--)
		sv[i - 1] = 1ll * sv[i] * t[i] % mod;
	for(int i = 1;i <= n;i++)
		inv[i] = 1ll * sv[i] * s[i - 1] % mod;
	int ans = 0,x = 1;
	for(int i = 1;i <= n;i++){
		x = 1ll * x * i % mod;
		ans = (ans + 1ll * x * inv[i]) % mod;
	}
	write(ans);
}