n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mod = 998244353

ar = [[0 for i in range(20)] for j in range(n)]
br = [[0 for i in range(20)] for j in range(m)]

for i in range(n):
	for j in range(20):
		ar[i][j] = (a[i] >> j) & 1

for i in range(m):
	for j in range(20):
		br[i][j] = (b[i] >> j) & 1

ans = 1
for i in range(20):
	atmp = 0
	btmp = 0
	for j in range(n):
		atmp += ar[j][i]
	for j in range(m):
		btmp += br[j][i]
	#print(atmp, btmp, n-atmp, m-btmp)
	if (atmp + btmp) % 2 == 1:
		ans = 0
	ans = ans * pow(2, n*m-n-m+1, mod) % mod
	
print(ans)