#include<bits/stdc++.h>
using namespace std;

#define rep(i, a, n) for(int i=(a); i<(n); ++i)
#define per(i, a, n) for(int i=(a); i>(n); --i)
#define pb emplace_back
#define mp make_pair
#define clr(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(),(x).end()
#define lowbit(x) (x & -x)
#define fi first
#define se second
#define lson o<<1
#define rson o<<1|1
#define gmid l[o]+r[o]>>1
 
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll, ll>;
using ui = unsigned int;
 
constexpr int mod = 998244353;
constexpr int inf = 0x3f3f3f3f;
constexpr double EPS = 1e-8;
const double PI = acos(-1.0);

constexpr int N = 1e6 + 10;

ll pow_mod(ll x, int p){
  ll s = 1;
  while(p){
    if(p & 1) s = s * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return s;
}

int n, k;
ll fac[N], rev[N];

ll C(int n, int m){
  return fac[n] * rev[m] % mod * rev[n - m] % mod;
}

void _main(){
  cin >> n >> k;
  ll e = (1 + n) * pow_mod(2, mod - 2) % mod;
  if(k % 2 == 0){
    fac[0] = 1;
    rep(i, 1, N)  fac[i] = fac[i-1] * i % mod;
    rev[N - 1] = pow_mod(fac[N - 1], mod - 2);
    per(i, N - 1, 0)  rev[i-1] = rev[i] * i % mod;
    ll d = 0;
    rep(i, 1, n){
      d = d + pow_mod(i, k / 2) * pow_mod(n - i, k / 2) % mod;
    }
    d = d % mod * C(k, k / 2) % mod * pow_mod(pow_mod(n, mod - 2), k) % mod;
    d = d * pow_mod(2, mod - 2) % mod;
    e = (e + mod - d) % mod;
  }

  cout << e * pow_mod(n, k) % mod << '\n';
}

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  _main();
  return 0;
}