n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
MOD = 10**9+7
MAX = 1024

a_tmp = [0 for _ in range(MAX)]
a_tmp[0] = 1
xor = 0
for x in A:
	xor ^= x
	a_tmp[xor] += 1
a = [0 for _ in range(MAX)]

for j in range(MAX):
	a[0] += a_tmp[j] * (a_tmp[j]-1) // 2
for i in range(1, MAX):
	for j in range(MAX):
		if j > i^j:
			continue
		a[i] += a_tmp[j] * a_tmp[i^j]

b_tmp = [0 for _ in range(MAX)]
b_tmp[0] = 1
xor = 0
for x in B:
	xor ^= x
	b_tmp[xor] += 1
b = [0 for _ in range(MAX)]

for j in range(MAX):
	b[0] += b_tmp[j] * (b_tmp[j]-1) // 2
for i in range(1, MAX):
	for j in range(MAX):
		if j > i^j:
			continue
		b[i] += b_tmp[j] * b_tmp[i^j]

ans = 0
for i in range(MAX):
	ans += a[i] * b[i^k]
	ans %= MOD
print(ans)