#include<bits/stdc++.h>
using std::cin, std::cout;
using u64 = unsigned long long;
using u128 = __int128_t;
const int mod = 998244353;

const int N = 1 << 20;
int rev[N], wn[N], lim, invlim;
int pow(int a, int b, int ans = 1) {
	for(;b;b >>= 1, a = (u64) a * a % mod) if(b & 1)
		ans = (u64) ans * a % mod;
	return ans;
}
void init(int len) {
	lim = 2 << std::__lg(len - 1);
	invlim = mod - (mod - 1) / lim;
	for(static int i = 1;i < lim;i += i) {
		wn[i] = 1;
		const int w = pow(3, mod / i / 2);
		for(int j = 1;j < i;++j) {
			wn[i + j] = (u64) wn[i + j - 1] * w % mod;
		}
	}
	for(int i = 1;i < lim;++i) {
		rev[i] = rev[i >> 1] >> 1 | (i % 2u * lim / 2);
	}
}
void DFT(u64 * a) {
	static u64 t[N];
	for(int i = 0;i < lim;++i) {
		t[i] = a[rev[i]];
	}
	for(int i = 1;i < lim;i += i) {
		for(int j = 0;j < lim;j += i + i) {
			for(int k = 0;k < i;++k) {
				const u64 x = t[i + j + k] * wn[i + k] % mod;
				t[i + j + k] = t[k + j] + mod - x;
				t[k + j] += x;
			}
		}
	}
	for(int i = 0;i < lim;++i) {
		a[i] = t[i] % mod;
	}
}
void IDFT(u64 * a) {
	DFT(a), std::reverse(a + 1, a + lim);
	for(int i = 0;i < lim;++i) {
		a[i] = (u64) a[i] * invlim % mod;
	}
}


int n, m;
int x[5];

u64 h[N];
u64 f[N], g[N];
u64 tmp[N];
const int B = 1000;

int main() {
#ifdef zqj
//	freopen("$.in", "r", stdin);
#endif
	cin >> n >> m;
	int sum = 0;
	for(int i = 0;i < 5;++i) cin >> x[i], sum += x[i];
	sum = pow(sum, mod - 2);
	for(int i = 0;i < 5;++i) {
		x[i] = (u64) x[i] * sum % mod;
		h[i] = x[i];
	}
	f[0] = 1;
	init((m + B) * 4);
	DFT(h);
	for(int i = 0;i < lim;++i) {
		h[i] = pow(h[i], B);
	}
	for(int i = 1;i <= m % B;++i) {
		for(int j = 0;j <= m * 4;++j) {
			g[j + 0] += f[j] * x[0];
			g[j + 1] += f[j] * x[1];
			g[j + 2] += f[j] * x[2];
			g[j + 3] += f[j] * x[3];
			g[j + 4] += f[j] * x[4];
		}
		// x => x + n - 2 * i
		const int kill = 2 * i - n;
		for(int j = 0;j <= m * 4;++j) {
			f[j] = g[j] % mod;
			g[j] = 0;
		}
		for(int i = 0;i < kill;++i) {
			f[i] = 0;
		}
	}
	for(int i = m % B + 1;i <= m;i += B) {
		const int prekill = std::max(2 * (i - 1) - n, 0);
		const int kill = std::max(2 * (i + B - 1) - n, 0);
		for(int j = kill;j <= m * 4;++j) {
			tmp[j] = f[j];
			f[j] = 0;
		}
		DFT(tmp);
		for(int j = 0;j < lim;++j) {
			tmp[j] = (u64) tmp[j] * h[j] % mod;
		}
		IDFT(tmp);
		for(int k = 0;k < B;++k) {
			const int R = kill + k * 4 + 4;
			for(int j = prekill;j < R;++j) {
				g[j + 0] += f[j] * x[0];
				g[j + 1] += f[j] * x[1];
				g[j + 2] += f[j] * x[2];
				g[j + 3] += f[j] * x[3];
				g[j + 4] += f[j] * x[4];
			}
			for(int j = prekill;j < R;++j) {
				f[j] = g[j] % mod;
				g[j] = 0;
			}
			for(int j = prekill;j < std::max(2 * (i + k) - n, 0);++j) {
				f[j] = 0;
			}
		}
		for(int j = kill;j <= m * 4;++j) {
			f[j] = (f[j] + tmp[j]) % mod;
		}
		memset(tmp, 0, lim << 2);
		memset(f, 0, kill << 2);
	}
	u64 ans = 0;
	for(int j = 0;j <= m * 4;++j) {
		ans += f[j];
	}
	cout << ans % mod << '\n';
}