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

#define int ll
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int>;
using i128 = __int128_t;
#define rep(i,a,b) for (int i = a; i < (b); ++i)
#define sz(v) (int)(v).size()
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define pb push_back


mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MAXN = 2e5+5;
const int MOD = 998244353;
int fac[MAXN]; // fac[n] = n!
int inv[MAXN]; // inv[n] = 1 / (n!)

int fix(int n) {
    n %= MOD;
    if (n < 0) n += MOD;
    return n;
}
int modpow(int n, int p) {
    int a = 1;
    while (p > 0) {
        if (p & 1) a = a * n % MOD;
        n = n * n % MOD;
        p >>= 1;
    }
    return a;
}
int comb(int n, int k) {
    assert(0 <= n);
    assert(0 <= k && k <= n);
    return fac[n] * inv[k] % MOD * inv[n-k] % MOD;
}


signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int N, M; cin >> N >> M;

    // precompute fac and inv
    fac[0] = 1;
    for (int i = 1; i < MAXN; ++i) fac[i] = fac[i-1] * i % MOD;
    inv[MAXN-1] = modpow(fac[MAXN-1], MOD-2);
    for (int i = MAXN-2; i >= 0; --i) inv[i] = inv[i+1] * (i+1) % MOD;
    assert(inv[0] == 1);

    vector<int> pows0(N+1); // pows0[k] is M^k
    vector<int> pows1(N+1); // pows1[k] is (N+M+1)^k
    pows0[0] = pows1[0] = 1;
    for (int i = 1; i <= N; ++i) {
        pows0[i] = pows0[i-1] * M % MOD;
        pows1[i] = pows1[i-1] * (N+M+1) % MOD;
    }

    int ans = 0;
    for (int n = 1; n <= N; ++n) {
        for (int k = 1; k <= n; ++k) {
            int critical = comb(n-1, k-1) * fac[k-1] % MOD * pows0[n-k] % MOD;
            int noncritical = comb(N-n+k-1, k-1) * pows1[N-n] % MOD;
            ans += critical * noncritical % MOD;
            ans %= MOD;
        }
    }

    cout << ans << '\n';

}