#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;

int main()
{
	ll n, m, k;
	cin >> n >> m >> k;
	vector<int> a(n), b(m);
	for (auto &i : a)
		cin >> i;
	for (auto &i : b)
		cin >> i;
	vector<int> suma(n + 1), sumb(m + 1);
	for (int i = 0; i < n; i++)
		suma[i + 1] ^= suma[i] ^ a[i];
	for (int i = 0; i < m; i++)
		sumb[i + 1] ^= sumb[i] ^ b[i];
	vector<ll> cnta(1024), cntb(1024);
	for (int i = 0; i < n + 1; i++)
		cnta[suma[i]]++;
	for (int i = 0; i < m + 1; i++)
		cntb[sumb[i]]++;
	vector<ll> ncnta(1024), ncntb(1024);
	for (int i = 0; i < 1024; i++)
		for (int j = i; j < 1024; j++)
		{
			if (i == j)
			{
				ncnta[i ^ j] += (cnta[i]-1) * cnta[j]/2 % MOD;
				ncnta[i ^ j] %= MOD;
				ncntb[i ^ j] += (cntb[i]-1) * cntb[j]/2 % MOD;
				ncntb[i ^ j] %= MOD;
				continue;
			}
			ncnta[i ^ j] += cnta[i] * cnta[j] % MOD;
			ncnta[i ^ j] %= MOD;
			ncntb[i ^ j] += cntb[i] * cntb[j] % MOD;
			ncntb[i ^ j] %= MOD;
		}
	ll ans = 0;
	for(int i = 0;i<1024;i++)
	{
		for(int j = 0;j<1024;j++)
		{
			if((i^j)==k)
			{
				ans += ncnta[i]*ncntb[j];
				ans %= MOD;
			}
		}
	}
	cout << ans << endl;
}