#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline)) static
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;
using ll = long long;

#define IC isdigit(c)
#define GC c=getchar()
void rd(auto &x) { x = 0; char GC; bool f = 0;
	for (; !IC; GC) f |= c == '-';
	for (; IC; GC) x = x * 10 + c - 48;
	if (f) x = -x;
}
void rd(auto &x, auto &...y) { rd(x); rd(y...); }
#define meow(...) fprintf(stderr, __VA_ARGS__)
#define Assert(e) if (!(e)) { meow("AF@%d\n", __LINE__); exit(__LINE__); }

const int N = 1005, M = 12, SX = 1 << M;
const ll P = 998244353;
void I(ll &x, ll v) { (x += v) %= P; }
ll fac[N], ifac[N], inv[N], har[N], sNum[N];
ll qpow(ll x, ll t = P - 2) { ll v = 1; for (; t; (x *= x) %= P, t >>= 1) if (t & 1) (v *= x) %= P; return v; }
void gFac() {
	fac[0] = ifac[0] = 1;
	U (i, 1, N - 1) fac[i] = fac[i - 1] * i % P;
	ifac[N - 1] = qpow(fac[N - 1]);
	D (i, N - 2, 1) ifac[i] = ifac[i + 1] * (i + 1) % P;
	U (i, 1, N - 1)
		inv[i] = ifac[i] * fac[i - 1] % P,
		har[i] = (har[i - 1] + inv[i]) % P,
		sNum[i] = (sNum[i - 1] + i) % P;
	// inv[0] = -P / 114;
	// inv[0] = 1;
	// inv[0] = 0;
}
ll C(int n, int m) {
	if (m > n || m < 0) return 0;
	return fac[n] * ifac[n - m] % P * ifac[m] % P;
}
// ll sInv(int l, int r) { return (har[r] - har[l - 1] + P) % P; }
ll sum(int l, int r) { return (sNum[r] - sNum[l - 1] + P) % P; }
ll desPw(int n, int m) {
	if (m > n) return 0;
	return fac[n] * ifac[n - m] % P;
}
ll iDesPw(int n, int m) {
	if (m > n) return 0;
	return ifac[n] * fac[n - m] % P;
}

int n, m, a[M], b[M], S;
int sumA[SX], sumB[SX];
ll f[SX][N], g[SX][N], sum1[SX][N] {}, sum2[SX][N] {}, sum3[SX][N] {};

void genSum(int s) {
	U (j, 0, n) {
		if (j)
			sum1[s][j] = sum1[s][j - 1],
			sum2[s][j] = sum2[s][j - 1],
			sum3[s][j] = sum3[s][j - 1];
		int delta = sumA[s] - sumB[s];
		if (n - j - delta < 0) continue;
		I(sum1[s][j], ifac[n - j - delta] * g[s][j]);
		I(sum2[s][j], ifac[n - j - delta] * f[s][j]);
		I(sum2[s][j], ifac[n - j - delta]
			* delta % P
			* har[n - j - delta] % P
			* g[s][j]);
		I(sum3[s][j], ifac[n - j - delta] * g[s][j] % P * delta % P);
	}
}

int main() {

	rd(n, m);
	int inital = 0;
	U (i, 0, m - 1) rd(a[i]);
	U (i, 0, m - 1) {
		rd(b[i]);
		if (b[i] == 0) inital |= 1 << i;
	}
	gFac();

	S = (1 << m) - 1;
	U (s, 1, S) {
		int i = __lg(s & -s), t = s ^ (1 << i);
		sumA[s] = sumA[t] + a[i];
		sumB[s] = sumB[t] + b[i];
	}

	g[inital][0] = 1;
	
	U (s, inital + 1, S) {
		genSum(s - 1);
		
		if ((s & inital) != inital) continue;
		U (i, 1, n) U (x, 0, m - 1) if ((s >> x) & 1) {
			if (!b[x]) continue;
			int t = s ^ (1 << x), delta = sumA[t] - sumB[t];
			if (b[x] - 1 > i - 1 - sumB[t]) continue;
			if (n - i + 1 - (sumA[t] - sumB[t]) <= 0) continue; 

			ll g0 = g[s][i], f0 = f[s][i];
			ll z = C(i - 1 - sumB[t], b[x] - 1)
				* fac[n - i - delta] % P
				* fac[a[x]] % P * ifac[a[x] - b[x]] % P;
			ll bSum1 = 0, bSum2 = 0;
			// if (s == 3 && i == 3 && x == 1)
			// 	meow("gg\n");
			// U (j, 0, i - 1) { // to be prefix optimized
			// 	ll p = 1;
			// 	// p = C(i - 1 - sumB[t], b[x] - 1);
			// 	// if (!p) continue;
				
			// 	(p *= ifac[n - j - delta]) %= P;
			// 	// (p *= fac[n - i + 1 - 1 - (sumA[t] - sumB[t])]) %= P;
			// 	// (p *= fac[a[x]] * ifac[a[x] - b[x]] % P) %= P;
			// 	ll len = delta * (har[n - j - delta] - har[n - i - delta] + P) % P;
			// 	I(g[s][i], g[t][j] * p % P * z % P);
			// 	I(f[s][i], (f[t][j] + g[t][j] * len) % P * p % P * z % P);
			// 	I(bSum1, f[t][j] * p % P + g[t][j] * har[n - j - delta] % P * p % P * delta % P);
			// 	I(bSum2, g[t][j] * delta % P * p % P);
			// 	ll ass = f[t][j] * p % P + g[t][j] * har[n - j - delta] % P * p % P * delta % P;
			// 	ass -= g[t][j] * delta % P * p % P * har[n - i - delta] % P - P;
			// 	ass %= P;
			// 	if (ass * z % P != (f[t][j] + g[t][j] * len) % P * p % P * z % P)
			// 		meow("?\n");
			// }
			// ll tg = g[s][i], tf = f[s][i];
			// if (tf)
			// 	meow("meow\n");
			ll p = z;
			g[s][i] = g0; f[s][i] = f0;

			// Assert(sum2[t][i - 1] == bSum1);
			// Assert(sum3[t][i - 1] == bSum2);
			// if ((bSum1 - bSum2 * har[n - i - delta] % P + P) % P * p % P != (tf - f[s][i] + P) % P)
			// 	meow("pity\n");
			// if ((g[s][i] + p * sum1[t][i - 1]) % P != tg)
			// 	meow("fuck\n");
			I(g[s][i], p * sum1[t][i - 1]);
			I(f[s][i], (sum2[t][i - 1] - sum3[t][i - 1] * har[n - i - delta] % P + P) % P * p);
			
			// g[s][i] = tg; f[s][i] = tf;
		}
	}

	clog << g[S][sumB[S]] << endl;
	cout << (f[S][sumB[S]] + sumB[S]) % P << endl; // f 只记了抽出不合法的期望步数
}