#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) begin(x), end(x)

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define sz(x) (int)(x).size()
typedef vector<int> vi;
const ll mod = 998244353, root = 62;

ll modpow(ll b, ll e) {
    ll ans = 1;
    for (; e; b = b * b % mod, e /= 2)
        if (e & 1) ans = ans * b % mod;
    return ans;
}

typedef vector<ll> vl;
void ntt(vl &a) {
    int n = sz(a), L = 31 - __builtin_clz(n);
    static vl rt(2, 1);
    for (static int k = 2, s = 2; k < n; k *= 2, s++) {
        rt.resize(n);
        ll z[] = {1, modpow(root, mod >> s)};
        rep(i,k,2*k) rt[i] = rt[i / 2] * z[i & 1] % mod;
    }
    vi rev(n);
    rep(i,0,n) rev[i] = (rev[i / 2] | (i & 1) << L) / 2;
    rep(i,0,n) if (i < rev[i]) swap(a[i], a[rev[i]]);
    for (int k = 1; k < n; k *= 2)
        for(int i = 0; i < n; i += 2*k) rep(j,0,k) {
            ll z = rt[j + k] * a[i + j + k] % mod, &ai = a[i + j];
            a[i + j + k] = ai - z + (z > ai ? mod : 0);
            ai += (ai + z >= mod ? z - mod : z);
        }
}

vl conv(const vl &a, const vl &b) {
    if (a.empty() || b.empty()) return {};
    int s = sz(a) + sz(b) - 1, B = 32 - __builtin_clz(s), n = 1<<B;
    int inv = modpow(n, mod - 2);
    vl L(a), R(b), out(n);
    L.resize(n); R.resize(n);
    ntt(L), ntt(R);
    rep(i,0,n) out[-i & (n-1)] = (ll)L[i] * R[i] % mod * inv % mod;
    ntt(out);
    return {out.begin(), out.begin() + s};
}

const int N = 303303, C = 2000;
int n, m, dp[N], tmp[4 * C + 5];
ll p[5];

vl get_trans(int x) {
    vl trans {1}, base(p, p + 5);
    while(x) {
        if(x & 1) trans = conv(trans, base);
        base = conv(base, base);
        x >>= 1;
    }
    return trans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    int s = 0;
    for(auto &i : p) cin >> i, s = (s + i) % mod;
    int is = modpow(s, mod - 2);
    for(auto &i : p) i = i * 1ll * is % mod;

    dp[n] = 1;
    n = n + 2 * m;
    vl trans = get_trans(C);
    for(int i = 0; i < m;) {
        int step = min(m - i, C);
        i += step;
        if(step != C) trans = get_trans(step);

        vl top(n - 2 * step + 1);
        for(int i = 2 * step; i <= n; i++)
            top[i - 2 * step] = dp[i], dp[i] = 0;
        
        for(int it = step; it--;) {
            memset(tmp, 0, sizeof tmp);
            for(int i = 0; i < 4 * step; i++) {
                for(int j = (i < 2) + (i < 1); j < 5; j++) {
                    // cout << i << " " << i + j - 2 << " " << dp[i] * 1ll * p[j] % mod <<endl;
                    tmp[i + j - 2] = (tmp[i + j - 2] + dp[i] * 1ll * p[j]) % mod;
                }
            }
            memmove(dp, tmp, 4 * step * sizeof(int));
        }

        top = conv(top, trans);

        for(int i = 0; i <= n; i++) {
            // cout << i << " == " << dp[i] << " " << top[i] << endl;
            dp[i] = dp[i] + top[i] >= mod ? dp[i] + top[i] - mod : dp[i] + top[i];
        }
    }
    ll sum = 0;
    for(auto &i : dp) {sum += i;}
    cout << sum % mod << '\n';
}