//qoj5817
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll P = 998244353;
const int N = 2e7 + 10;
int n, k, fac[N];
int p[N], vis[N], pc, val[N];

ll qp(ll x, ll y){
	ll ans = 1;
	while(y){
		if(y & 1){
			ans = ans * x % P;
		}
		x = x * x % P;
		y >>= 1;
	}
	return ans;
}

int main(){
	scanf("%d%d", &n, &k);
	fac[0] = 1;
	for(int i = 1; i <= n; ++ i){
		fac[i] = (ll)fac[i-1] * i % P;
	}
	val[1] = 1;
	for(int i = 2; i <= n; ++ i){
		if(!vis[i]){
			p[++pc] = i;
			val[i] = qp(i, k);
			val[i] = qp(val[i], P-2);
		}
		for(int j = 1; j <= pc && i * p[j] <= n; ++ j){
			vis[i*p[j]] = 1;
			val[i*p[j]] = (ll)val[i] * val[p[j]] % P;
			if(i % p[j] == 0){
				break;
			}
		}
	}
	ll ans = 0;
	for(int i = 1; i <= n; ++ i){
		ans = (ans + 1ll * fac[i] * val[i]) % P;
	}
	printf("%lld\n", ans);
	return 0;
}