#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll LINF = 1LL << 60;
const int IINF = 1 << 30;

template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};

/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;

ll pow_mod(ll x, ll n, ll mod){
    ll ret = 1;
    while(n > 0){
        if(n & 1) ret = (ret*x)%mod;
        x = x*x%mod;
        n >>=1;
    }
    return ret;
}

const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
ll MOD = MOD998244353;
void cominit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(ll i=2; i<MAX; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
 
ll com(ll n, ll k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    cominit();
    ll h, w; cin >> h >> w;
    h++; w++;
    //dp_h[i]:=合計i個の矢印でh-1に到達する組み合わせ
    //dp_w[i]:=合計i個の矢印でw-1に到達する組み合わせ
    vector<ll> dp_h(h, 0), dp_w(w, 0);
    for(ll n2=0; n2<=(h-1)/2; n2++){
        ll n1 = (h-1)-n2*2;
        dp_h[n1+n2] = com(n1+n2, n1)*finv[n1+n2]%MOD;
    }
    for(ll n2=0; n2<=(w-1)/2; n2++){
        ll n1 = (w-1)-n2*2;
        dp_w[n1+n2] = com(n1+n2, n1)*finv[n1+n2]%MOD;
    }

    vector<ll> a, b;
    for(ll i=h/2; i<=h-1; i++) a.pb(dp_h[i]);
    for(ll j=w/2; j<=w-1; j++) b.pb(dp_w[j]);

    vector<ll> c = convolution<MOD998244353>(a, b);
    ll ans = 0;
    for(ll i=h/2+w/2; i<=h+w-2; i++) ans = (ans + fac[i]*c[i-(h/2+w/2)]%MOD)%MOD;
    cout << ans << endl;
}