n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
def cul(l):
    res = 0
    for i in range(len(l)):
        res ^= l[i]
    return res
if cul(a) == cul(b):
    mod = 998244353
    print(pow(2,(m-1)*(n-1),mod)**20 % mod)
else:
    print(0)