import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# 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)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

def CNT(aa):
    cnt = [0]*(1 << 10)
    cnt[0] = 1
    s = 0
    for a in aa:
        s ^= a
        cnt[s] += 1
    cntlr = [0]*(1 << 10)
    for i in range(1 << 10):
        cntlr[0] += cnt[i]*(cnt[i]-1)//2
        cntlr[0] %= md
        for j in range(i):
            cntlr[i ^ j] += cnt[i]*cnt[j]
            cntlr[i ^ j] %= md
    return cntlr

n, m, k = LI()
aa = LI()
bb = LI()

cnt1 = CNT(aa)
cnt2 = CNT(bb)
ans = 0
for i in range(1 << 10):
    ans += cnt1[i]*cnt2[i ^ k]
    ans%=md

print(ans)