import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    N,M = map(int,input().split())
    if N == 1 or M == 1:
        val = 1
    else:
        val = pow(2,(N-1)*(M-1),MOD)
    A = list(map(int,input().split()))
    B = list(map(int,input().split()))

    ans = 1
    for i in range(20):
        P = [(a>>i)&1 for a in A]
        Q = [(b>>i)&1 for b in B]
        if sum(P)%2 == sum(Q)%2:
            temp = val
        else:
            temp = 0
        ans *= temp
        ans %= MOD
    print(ans)

if __name__ == '__main__':
    main()