#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline
n,x,y=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
bina = [0] * 18
binb = [0] * 18
for aa in a:
    for i in range(18):
        if aa >> i & 1:
            bina[i] += 1
for bb in b:
    for i in range(18):
        if bb >> i & 1:
            binb[i] += 1
ans = 0
for i in range(18):
    if binb[i] == 0:continue
    m = 1 << i
    powb = pow(y,n,mod)
    powa = pow(x,n,mod)
    ans += powa * powb % mod * m % mod
    ans %= mod
    invb = pow(y,mod-2,mod)
    inva = pow(x,mod-2,mod)
    for j in range(n):
        powb *= invb
        powb %= mod
        ans -= powb * (y - binb[i]) % mod * powa % mod * m % mod
        ans %= mod
        powb *= binb[i]
        powb %= mod
        powa *= inva * (x - bina[i]) % mod
        powa %= mod
    ans -= powb * powa % mod * m % mod
    ans %= mod
print(ans)