#include <bits/stdc++.h>
using ll = long long;
#define int ll
const int N = 1e6 + 5;
const int MOD = 998244353;

std::vector<int> fac, inv;

int QSM (int x, int p) {
  int ans = 1;
  while (p) {
    if (p & 1) ans = 1ll * ans * x % MOD;
    p >>= 1, x = 1ll * x * x % MOD;
  }
  return ans;
}

void Prep() {
  fac = std::vector<int> (N, 1);
  inv = std::vector<int> (N, 1);
  for (int i = 1; i < N; ++i) fac[i] = 1ll * fac[i - 1] * i % MOD;
  inv[N - 1] = QSM(fac[N - 1], MOD - 2);
  for (int i = N - 2; i >= 1; --i) inv[i] = 1ll * inv[i + 1] * (i + 1) % MOD;
}

int C (int n, int m) {
  if (n < m) return 0;
  else return 1ll * fac[n] * inv[m] % MOD * inv[n - m] % MOD;
}

void force(int n, int k) {
  std::vector<int> cnt(n + 1);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      for (int p1 = 1; p1 <= n; ++p1) {
        for (int p2 = 1; p2 <= n; ++p2) {
          std::vector<int> vec;
          vec.emplace_back(i);
          vec.emplace_back(j);
          vec.emplace_back(p1);
          vec.emplace_back(p2);
          sort(vec.begin(), vec.end());
          ++cnt[vec[k / 2 - 1]];
        }
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) ans = (ans + 1ll * i * cnt[i] % MOD) % MOD;
  std::cout << ans << '\n';
}

void charming() {
  int n, k; std::cin >> n >> k;
  int ans = 0;
  if (k & 1) {
    ans = 1ll * (n + 1) * QSM(2, MOD - 2) % MOD * QSM(n, k) % MOD;
    std::cout << ans << '\n';
    return;
  }
  int cnt = 0;
  for (int i = 1, ncnt; i <= n; ++i) {
    ncnt = 1ll * C(k, k / 2) * (C(k / 2 + i - 1, k / 2) - C(k / 2 + i - 2, k / 2)) % MOD;
    ncnt = 1ll * ncnt * C(n - i + k / 2 - 1, k / 2) % MOD;
    cnt = (cnt + ncnt) % MOD;
    ans = (ans + 1ll * ncnt * i % MOD) % MOD;
    // std::cout << i << " " << cnt << '\n';
  }
  ans = (ans + 1ll * (n + 1) * QSM(2, MOD - 2) % MOD * (QSM(n, k) - cnt) % MOD) % MOD;
  ans = (ans + MOD) % MOD;
  std::cout << ans << '\n';
  
  // force(n, k);
}

signed main() {
  Prep();
  charming();
  return 0;
}