#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, K;
    cin >> N >> K;
    
    vector<mint> fact(N + K + 1);
    fact[0] = 1;
    for (ll i = 0; i < N + K; i++) {
        fact[i + 1] = (fact[i] * mint(i + 1));
    }
    vector<mint> inv_val(N + K + 1);
    inv_val[0] = 1;
    inv_val[1] = 1;
    for (ll i = 2; i <= N + K; i++) {
        inv_val[i] = (inv_val[mod2 % i] * mint(-mod2 / i));
    }
    vector<mint> fact_inv(N + K + 1);
    fact_inv[0] = 1;
    for (ll i = 0; i < N + K; i++) {
        fact_inv[i + 1] = (fact_inv[i] * inv_val[i + 1]);
    }

    auto comb = [&fact, &fact_inv](ll n, ll r) -> mint {
        mint ret;
        if (r < 0) {
            ret = mint(0);
        } else if (r > n) {
            ret = mint(0);
        } else {
            ret = (fact[n] * fact_inv[n - r]);
            ret = (ret * fact_inv[r]);
        }
        return ret;
    };

    mint prod_pef = fact[K];
    prod_pef *= fact_inv[N + K];
    prod_pef /= mint(N).pow(K);

    mint ans = mint(0);
    for (ll i = 0; i <= N; i++){
        mint subprd = comb(N, i);
        if ((N - i) % 2 == 1){
            subprd *= mint(mod2 - 1);
        }
        subprd *= mint(i).pow(N + K);
        ans += subprd;
    }
    cout << (ans * prod_pef).val() << endl;
}