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

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=1<<19,mod=998244353,G=3;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x); return res;}

struct NTT {
  ll w[N];
  NTT() {
    ll dw = Pow(G, (mod - 1) / N);
    w[0] = 1;
    for (int i = 1; i < N; ++i)
      w[i] = mul(w[i - 1], dw);
  }
  void operator()(vector<int>& a, bool inv = false) { //0 <= a[i] < P
    int x = 0, n = a.size();
    for (int j = 1; j < n - 1; ++j) {
      for (int k = n >> 1; (x ^= k) < k; k >>= 1);
      if (j < x) swap(a[x], a[j]);
    }
    for (int L = 2; L <= n; L <<= 1) {
      int dx = N / L, dl = L >> 1;
      for (int i = 0; i < n; i += L) {
        for (int j = i, x = 0; j < i + dl; ++j, x += dx) {
          ll tmp = mul(a[j + dl], w[x]);
          a[j + dl] = sub(a[j], tmp);
          a[j] = add(a[j], tmp);
        }
      }
    }
    if (inv) {
      reverse(a.begin() + 1, a.end());
      ll invn = Pow(n, mod - 2);
      for (int i = 0; i < n; ++i)
        a[i] = mul(a[i], invn);
    }
  }
} ntt;

vector <int> Mul(vector <int> a, vector <int> b, int bound = N) {
  int m = a.size() + b.size() - 1, n = 1;
  while (n < m) n <<= 1;
  a.resize(n), b.resize(n);
  ntt(a), ntt(b);
  vector <int> out(n);
  for (int i = 0; i < n; ++i) out[i] = mul(a[i], b[i]);
  ntt(out, true), out.resize(min(m, bound));
  return out;
}

int n,m;
vector<int> P(5),pow_P[17];

vector<int> get_pow(int k){
    vector<int> res={1};
    for(int i=0; i<17; ++i) if(k>>i&1) res=Mul(res,pow_P[i]);
    return res;
}

vector<int> solve(int l, int r, vector<int> vec){
    if(l==r) return vec;
    vector<int> res(sz(vec)+2*(r-l));
    if(l+1==r){
        for(int i=0; i<sz(vec); ++i) for(int j=0; j<5; ++j) if(i+j-2>=0) res[i+j-2]=add(res[i+j-2],mul(vec[i],P[j]));
        return res;
    }
    if(sz(vec)>2*(r-l)){
        vector<int> vec1(vec.begin()+2*(r-l),vec.end());
        vec1=Mul(vec1,get_pow(r-l));
        for(int i=0; i<sz(vec1); ++i) res[i]=add(res[i],vec1[i]);
    }
    vector<int> vec1(vec.begin(),vec.begin()+min(2*(r-l),sz(vec)));
    int mid=l+r>>1;
    vec1=solve(l,mid,vec1);
    vec1=solve(mid,r,vec1);
    for(int i=0; i<sz(vec1); ++i) res[i]=add(res[i],vec1[i]);
    return res;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m;
    {
        int tot=0;
        for(int i=0; i<5; ++i) cin >> P[i],tot+=P[i];
        for(int i=0; i<5; ++i) P[i]=mul(P[i],Pow(tot));
    }
    pow_P[0]=P;
    for(int i=1; i<17; ++i) pow_P[i]=Mul(pow_P[i-1],pow_P[i-1]);
    vector<int> vec(n+1);
    vec[n]=1;
    vec=solve(0,m,vec);
    int res=0;
    for(int i=0; i<sz(vec); ++i) res=add(res,vec[i]);
    cout << res << "\n";
}