import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

def cal(k):
    dp = [1, 0]
    for _ in range(n):
        ndp = [0, 0]
        ndp[0] = dp[0]*(x*y%md-cc[0][k]*cc[1][k]%md)%md+dp[1]*x%md*(y-cc[1][k])%md
        ndp[1] = dp[0]*cc[0][k]%md*cc[1][k]%md+dp[1]*x%md*cc[1][k]%md
        ndp[0] %= md
        ndp[1] %= md
        dp = ndp

    return dp[1]*pow(2, k, md)%md

def cnt(aa, i):
    for a in aa:
        for k in range(18):
            cc[i][k] += a & 1
            a >>= 1

n, x, y = LI()
aa = LI()
bb = LI()

cc = [[0]*18, [0]*18]
cnt(aa, 0)
cnt(bb, 1)

ans = 0
for k in range(18):
    ans += cal(k)
    ans %= md

print(ans)