#include <atcoder/modint>
#include <bits/stdc++.h>

#define ll long long

using namespace std;
using namespace atcoder;

using mint = modint998244353;

mint comb(int n, int r, vector<mint> &facts) {
    return facts.at(n) / (facts.at(r) * facts.at(n-r));
}

int main() {
    ll H, W;
    cin >> H >> W;

    if (H == 1 || W == 1) {
        cout << 1 << endl;
        return 0;
    }

    vector<mint> facts(max(H, W+1), 1);
    for (int i = 0; i < facts.size() - 1; i++) {
        facts.at(i+1) = (i+1) * facts.at(i);
    }

    mint ans = 0;

    for (int i = 0; i < min(2*H-2, 2*W-1); i++) {
        int x = i / 2;
        int y = (i+1) / 2;
        mint pow = mint(2).pow((H-1)*(W-1) - i);

        ans += pow * comb(H-2, x, facts) * comb(W-1, y, facts);
    }

    cout << ans.val() << endl;
}