#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
const int N = 2e6 + 66, mod = 998244353;
int fact[N], ifact[N];
void calc() {
	ifact[0] = fact[0] = ifact[1] = 1;
	for(int i = 2; i < N; i++) {
		ifact[i] = mod - (mod / i) * 1ll * ifact[mod % i] % mod; 
	}
	for(int i = 1; i < N; i++) {
		fact[i] = fact[i - 1] * 1ll * i % mod;
		ifact[i] = ifact[i - 1] * 1ll * ifact[i] % mod;
	}
}
int nck(int n, int k) {
	if(k < 0 || k > n) return 0;
	int ans = fact[n] * 1ll * ifact[k] % mod;
	return ans * 1ll * ifact[n-k]%mod;
}
int bp(int a, int p) {
	int r = 1;
	for(; p; p>>=1, a = a*1ll*a%mod)
		if(p&1) r = r*1ll*a%mod;
	return r;
}
 main() {
	cin.tie(0)->sync_with_stdio(0);
	//E[med] = sum_{x=0...inf} P[med > x] = sum_k=...n/2-1 P[cnt_(<=x) = k]
	calc();
	int n, k;
	cin >> n >> k;
	if(k & 1) {
		ll ans = bp(n, k) * 1ll * (n + 1) % mod;
		ans = ans * 1ll * ((mod+1)/2) % mod;
		cout << ans << '\n';
		return 0;
	}
	ll exp_diff = 0;
	for(int i = 1; i < n; i++) {
		exp_diff += bp(i, k/2)*1ll*bp(n-i, k/2) % mod;
	}
	exp_diff = (exp_diff % mod) * 1ll * nck(k, k/2) % mod;
	ll exp_sum = (n + 1) * 1ll * bp(n, k) % mod;
	ll smoll = (mod + exp_sum - exp_diff) * 1ll * ((mod+1)/2) % mod;
	cout << smoll << '\n';
	
}/*
2 piles sum <= 2
0 0
0 1
0 2
1 1
*/