MOD = 998244353

def matpow(A, B, w):
    l = len(A)
    while w:
        if w & 1:
            C = [0] * l
            for i in range(l):
                for j in range(l):
                    C[i] += A[i][j] * B[j]
                    C[i] %= MOD
            B = C
        C = [[0] * l for _ in range(l)]
        for i in range(l):
            for j in range(l):
                for k in range(l):
                    C[i][j] += A[i][k] * A[k][j]
                    C[i][j] %= MOD
        A = C
        w >>= 1
    return B

n, x, y = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

ans = 0
for i in range(18):
    ac = [0, 0]
    for a in A:
        if a >> i & 1:
            ac[1] += 1
        else:
            ac[0] += 1
    bc = [0, 0]
    for b in B:
        if b >> i & 1:
            bc[1] += 1
        else:
            bc[0] += 1

    B_ = [1, 0]
    A_ = [[0, 0], [0, 0]]
    A_[0][0] += ac[0] * bc[0]
    A_[0][0] += ac[0] * bc[1]
    A_[0][0] += ac[1] * bc[0]
    A_[1][0] += ac[1] * bc[1]
    A_[0][1] += ac[0] * bc[0]
    A_[1][1] += ac[0] * bc[1]
    A_[0][1] += ac[1] * bc[0]
    A_[1][1] += ac[1] * bc[1]
    ret = matpow(A_, B_, n)
    ans += ret[1] << i
    ans %= MOD
print(ans)