#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
const int MOD = 998244353;
vector<long long> fact, fact_inv, inv;
void nCk_calc(int s) {
    fact.resize(s + 2);
    fact_inv.resize(s + 2);
    inv.resize(s + 2);
    fact[0] = 1;
    fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < s + 2; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}
int main() {
nCk_calc(200005);
 int n,m;cin>>n>>m;
 int a,b,c,d;cin>>a>>b>>c>>d;
 mint ans = 0;
 for(int i = 0;i <= min(d,b);i++){
   if(b-i>m-d||c<i||m-c<(m-d)-(b-i)||a<b-i||m-a<d-i){break;}
   mint res = 1;
   res *= nCk(m,d);
   res *= nCk(d,i);
   res *= nCk(m-d,b-i);
   res *= nCk(m-(b-i)-(d-i),a-(b-i));
   res *= nCk(m-i-((m-d)-(b-i)),c-i);
   ans += res;
 }
 cout << ans.val() << endl;return 0;
}