#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsig7ned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
const int N = 5000, mod = 998244353;
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
} 
int C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
inline int sgn(int x) {
	return (x & 1) ? mod - 1 : 1;
}

int n, m;
int a[N];
int b[N];

int f[N][N];
int g[N][N];
mt19937_64 orz(time(0) ^ *new int);
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	L(i, 0, m - 1) {
		cin >> a[i];
	}
	L(i, 0, m - 1) {
		cin >> b[i];
	}
//	n = 0;
//	m = orz() % 10 + 1;
//	L(i, 0, m - 1) 
//		a[i] = orz() % 10 + 1, b[i] = orz() % a[i], 
//		n += a[i];
	
	int sumc = 0;
	L(i, 0, m - 1) {
		sumc += b[i];
	}
	ll sum = 0;
	L(i, 0, m - 1) 
		sum += a[i];
	if(sum != n) while(true);
	L(i, 0, m - 1) if(a[i] < b[i]) while(true); 
	
	init(4097);
	int mul = 1;
	L(i, 0, sumc - 1) {
		mul = (ll) mul * inv[n - i] % mod;
	}
	L(i, 0, m - 1) {
		L(j, 0, b[i] - 1) {
			mul = (ll) mul * (a[i] - j) % mod;
		}
	}
	
	int dm = 0;
	L(i, 0, m - 1) 
		if(b[i] == 0)
			dm |= 1 << i;
	
	f[dm][0] = mul;
	g[dm][0] = 0;
	L(sub, 0, (1 << m) - 1) {
		int sumb = 0, qwq = 0;
		L(i, 0, m - 1) 
			if(sub >> i & 1) 
				sumb += b[i], qwq += a[i] - b[i];
		L(i, sumb, sumc - 1) {
			int kn = n - i;
			assert(kn - qwq > 0);
			int prob = (ll) kn * inv[kn - qwq] % mod;
			int sg = (ll) prob * prob % mod;
			
			(f[sub][i + 1] += (ll) f[sub][i] * prob % mod) %= mod;
			(g[sub][i + 1] += (ll) g[sub][i] * prob % mod) %= mod;
			(g[sub][i + 1] += (ll) f[sub][i] * sg % mod) %= mod;
			
			L(p, 0, m - 1) if(!(sub >> p & 1)) {
				int c = C(i - sumb, b[p] - 1);
				(f[sub + (1 << p)][i + 1] += (ll) c * f[sub][i] % mod * prob % mod) %= mod;
				(g[sub + (1 << p)][i + 1] += (ll) c * g[sub][i] % mod * prob % mod) %= mod;
				(g[sub + (1 << p)][i + 1] += (ll) c * f[sub][i] % mod * sg % mod) %= mod;
			}
		}
	}
	assert(f[(1 << m) - 1][sumc] == 1);
	cout << g[(1 << m) - 1][sumc] << '\n';
	return 0;
}

/*
1000 12
101 43 34 281 23 24 12 25 66 222 145 24
37 43 27 257 5 11 12 19 62 41 87 0
*/