#include <bits/stdc++.h>
#define int long long

using namespace std;

const int M = 998244353;
int n, k, fact[1000001];

int pow2(int a, int b) {
    if(b==0) return 1;
    int c = pow2(a, b/2);
    c = (c*c)%M;
    if(b%2==1) c = (c*a)%M;
    return c;
}

int inv(int a) {
    return pow2(a, M-2);
}

int choose(int a, int b) {
    return (((fact[a] * inv(fact[b]))%M) * inv(fact[a-b]))%M;
}

int mod(int a) {
    return (a%M + M)%M;
}

signed main() {
    fact[0] = 1;
    for(int i = 1; i <= 1000000; i++) fact[i] = (fact[i-1] * i)%M;
    cin>>n>>k;
    if(k%2==1) {
        int ans = pow2(n, k);
        ans = ((ans * (n+1))%M * inv(2))%M;
        cout << ans << '\n';
        return 0;
    }
    int ans =0;
    for(int i= 1; i <= n; i++) {
        ans += (((i * choose(k, k/2))%M * (mod(pow2(i, k/2) - pow2(i-1, k/2))))%M * pow2(n - i, k/2))%M;
    }
    ans %= M;
    k--;
    ans += ((pow2(n, k) * (n+1))%M * inv(2))%M;
    ans %= M;
    cout << ans << '\n';
}