#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
inline int sqr(int x) { return 1ll * x * x % mod; }
int qpow(int a, int b) {
	if (!b) return 1;
	int t = qpow(a, b >> 1);
	t = mul(t, t);
	if (b & 1) return mul(t, a);
	return t;
}
const int maxn = 1000, maxm = 12;
int fac[maxn + 5], ifac[maxn + 5];
void init(int n) {
	fac[0] = 1;
	for (int i = 1; i <= n; i++) fac[i] = mul(fac[i - 1], i);
	ifac[n] = qpow(fac[n], mod - 2);
	for (int i = n - 1; ~i; i--) ifac[i] = mul(ifac[i + 1], i + 1);
}
inline int C(int m, int n) { return mul(fac[m], mul(ifac[m - n], ifac[n])); }
int a[maxm + 5], b[maxm + 5];
int sa[1 << maxm], sb[1 << maxm];
int f[maxn + 5][1 << maxm], g[maxn + 5][1 << maxm];
int sf[maxn + 5][1 << maxm], sg[maxn + 5][1 << maxm], sg2[maxn + 5][1 << maxm];
int p[maxn + 5][maxn + 5];
inline void upd(int& x, int y) { x = add(x, y); }
int main() {
	int n, m, Na = 0, Nb = 0;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++) scanf("%d", &a[i]);
	int ss = 0;
	for (int i = 0; i < m; i++) {
		scanf("%d", &b[i]), Nb += b[i];
		if (!b[i]) ss |= 1 << i;
		else Na += a[i];
	}
	int S = 1 << m;
	for (int s = 0; s < S; s++) {
		sa[s] = n;
		for (int i = 0; i < m; i++)
			if ((s >> i) & 1) sa[s] -= a[i], sb[s] += b[i];
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++) p[i][j] = add(p[i][j - 1], mul(n - j + 1, qpow(i - j + 1, mod - 2))); 
	init(n);
	sg[0][ss] = ifac[Na];
	for (int i = 1; i <= Nb; i++)
		for (int s = 0; s < S; s++) {
			if (i < sb[s]) continue;
			for (int x = 0; x < m; x++)
				if ((s >> x) & 1) {
					int fs = s ^ (1 << x);
					upd(f[i][s], mul(add(sub(mul(sg[i - 1][fs], p[sa[fs] + sb[fs]][i]), sg2[i - 1][fs]), sf[i - 1][fs]), mul(C(i - 1 - sb[fs], b[x] - 1), fac[sa[fs] - i + sb[fs]])));
					upd(g[i][s], mul(sg[i - 1][fs], mul(C(i - 1 - sb[fs], b[x] - 1), fac[sa[fs] - i + sb[fs]])));
				}
			sf[i][s] = add(sf[i - 1][s], mul(f[i][s], ifac[sa[s] - i + sb[s]]));
			sg[i][s] = add(sg[i - 1][s], mul(g[i][s], ifac[sa[s] - i + sb[s]]));
			sg2[i][s] = add(sg2[i - 1][s], mul(g[i][s], mul(ifac[sa[s] - i + sb[s]], p[sa[s] + sb[s]][i])));
		}
	int ans = f[Nb][S - 1];
	for (int i = 0; i < m; i++) ans = mul(ans, mul(fac[a[i]], ifac[a[i] - b[i]]));
	printf("%d", ans);
}