#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 998244353;
const int N = 1e6 + 5;
const int BLOCK = 900;

int pw(int x, int y) {
	int r = 1;
	for (; y; y /= 2, x = x * 1ll * x % mod)
		if (y & 1)
			r = r * 1ll * x % mod;
	return r;
}

const int root = 565042129; // 3^(119 * 2^3)
const int root_pw = 1 << 20; // order of root
const int root_1 = pw(root, mod - 2);

void fft(vector<int> & a, bool invert) {
  int n = a.size();
  for(int i = 1, j = 0; i < n; i++) {
    int bit = n >> 1;
    for (j ^= bit; !(j&bit); j ^= (bit>>=1));
    if (i < j)
      swap(a[i], a[j]);
  }
  for(int len = 2; len <= n; len <<= 1) {
    int wlen = invert ? root_1 : root;
    for(int i = len; i < root_pw; i <<= 1)
      wlen = 1LL * wlen * wlen % mod;
    for(int i = 0; i < n; i += len) {
      for(int j=i, w=1; j < i + len/2; j++) {
        int u=a[j], v=1LL*a[j+len/2]*w % mod;
        a[j] = u+v < mod ? u+v : u+v-mod;
        a[j+len/2] = u-v < 0 ? u-v+mod : u-v;
        w = 1LL * w * wlen % mod;
      }
    }
  }
  if(invert) {
    int n_1 = pw(n, mod - 2);
    for(int & x : a)
      x = 1LL * x * n_1 % mod;
  }
}


int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n, m, s = 0; cin >> n >> m;
	if (m == 0) {
		cout << "1\n";
		return 0;
	}
	int mm = 1;
	while (mm <= 4 * m)
		mm *= 2;
	vector<int> a(5);
	for (int i = 0; i < 5; i++) {
		cin >> a[i];
		s += a[i];
	}
	s = pw(s, mod - 2);
	for (int i = 0; i < 5; i++)
		a[i] = a[i] * 1ll * s % mod;

	int lo = max(0, 2 * m - n);
//	vector<int> dp(4 * m + 1);
//	dp[2 * m] = 1;
//	for (int i = 0; i < m; i++) {
//		vector<int> ndp(4 * m + 1);
//		for (int j = lo; j <= 4 * m; j++) {
//			for (int k = -2; k <= 2; k++)
//				if (lo <= k + j && k + j <= 4 * m)
//					ndp[k + j] = (ndp[k + j] + dp[j] * 1ll * a[k + 2]) % mod;
//		}
//		swap(dp, ndp);
//	}
//	for (int i = 0; i <= 4 * m; i++) {
//		cout << dp[i] << " ";
//	}
//	cout << endl;
//	int ans = 0;
//	for (int i = max(0, 2 * m - n); i <= 4 * m; i++) {
//		ans += dp[i];
//		if (ans >= mod)
//			ans -= mod;
//	}
//	cout << ans << "\n";

	vector<int> cur(mm), arr(mm);
	cur[2 * m] = 1;
	for (int i = 0; i < 5; i++)
		arr[i] = a[i];
	fft(arr, 0);
	for (int i = 0; i < mm; i++)
		arr[i] = pw(arr[i], BLOCK);
//	fft(arr, 1);
	for (int i = 0; i < m;) {
		if (i + BLOCK >= m) {
			vector<int> nx(mm);
			for (int j = lo; j <= 4 * m; j++) {
				for (int k = -2; k <= 2; k++)
					if (lo <= k + j && k + j <= 4 * m)
						nx[k + j] = (nx[k + j] + cur[j] * 1ll * a[k + 2]) % mod;
			}
			swap(cur, nx);
			i++;
			continue;
		}
		vector<int> small(4 * BLOCK), tail(mm);
		for (int j = lo; j <= 4 * m && j - lo < 2 * BLOCK; j++) {
			small[j - lo] = cur[j];
			cur[j] = 0;
		}
		for (int it = 0; it < BLOCK; it++) {
			vector<int> tmp(4 * BLOCK);
			for (int j = 0; j < 4 * BLOCK; j++) {
				for (int k = -2; k <= 2; k++)
					if (0 <= k + j && k + j < 4 * BLOCK)
						tmp[k + j] = (tmp[k + j] + small[j] * 1ll * a[k + 2]) % mod;
			}
			swap(small, tmp);
		}
		for (int j = 0; j + lo + 2 * BLOCK <= 4 * m; j++) {
			cur[j] = cur[j + lo + 2 * BLOCK];
			cur[j + lo + 2 * BLOCK] = 0;
		}
		fft(cur, 0);
		for (int j = 0; j < mm; j++)
			cur[j] = cur[j] * 1ll * arr[j] % mod;
		fft(cur, 1);
		for (int j = 4 * m; j >= lo; j--) {
			cur[j] = cur[j - lo];
			cur[j - lo] = 0;
		}
		for (int j = lo; j <= 4 * m && j - lo < 4 * BLOCK; j++) {
			cur[j] += small[j - lo];
			if (cur[j] >= mod)
				cur[j] -= mod;
		}
		i += BLOCK;
	}
//	for (int i = 0; i <= 4 * m; i++) {
////		cout << cur[i] << " ";
//		assert(cur[i] == dp[i]);
//	}
//	cout << endl;
	int ans = 0;
	for (int i = lo; i <= 4 * m; i++) {
		ans += cur[i];
		if (ans >= mod)
			ans -= mod;
	}
	cout << ans << "\n";
}