#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define i128 __int128
#define db double
#define ld long db

#define M 20000005
#define N 200001
#define mod 998244353
#define mod2 1222827239
#define base 51787
#define base2 38833
#define inf 1e9+7
#define dinf 1e15
#define linf 7e18
#define eps 1e-15
#define delta 0.99777

ll qpow(ll a,ll b,ll p){
	ll e=1;
	while(b){
		if(b&1) e=e*a%p;
		a=a*a%p;
		b>>=1;
	}
	return e;
}

int n,k;

int prime[M],cnt;
bool vis[M];
int inv[M];
int fac[M];

void init(){
	inv[1]=1;
	fac[0]=fac[1]=1;
	for(int i=2;i<M;++i){
		fac[i]=1ll*fac[i-1]*i%mod;
		if(!vis[i]){
			prime[++cnt]=i;
			inv[i]=qpow(qpow(i,k,mod),mod-2,mod);
		}
		for(int j=1;j<=cnt&&i*prime[j]<M;++j){
			vis[i*prime[j]]=1;
			inv[i*prime[j]]=1ll*inv[i]*inv[prime[j]]%mod;
			if(i%prime[j]==0) break;
		}
	}
}

int ans;

int main(){
	scanf("%d %d",&n,&k);
	init();
	for(int i=1;i<=n;++i) ans=(ans+1ll*fac[i]*inv[i]%mod)%mod;
	printf("%d\n",ans);
	return 0;
}