#include<vector>
#include<set>
#include<map>
#include<queue>
#include<string>
#include<algorithm>
#include<iostream>
#include<bitset>
#include<functional>
#include<numeric>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<random>
#include<ctime>
#include<complex>
using namespace std;
typedef long long LL;
typedef double D;
#define all(v) (v).begin(), (v).end()
mt19937 gene(233);
typedef complex<double> Complex;
#define fi first
#define se second
#define ins insert
#define pb push_back
inline char GET_CHAR(){
	const int maxn = 131072;
	static char buf[maxn],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;
}
inline int getInt() {
	int res(0);
	char c = getchar();
	while(c < '0') c = getchar();
	while(c >= '0') {
		res = res * 10 + (c - '0');
		c = getchar();
	}
	return res;
}

inline LL fastpo(LL x, LL n, LL mod) {
	LL res(1);
	while(n) {
		if(n & 1) {
			res = res * (LL)x % mod;
		}
		x = x * (LL) x % mod;
		n /= 2;
	}
	return res;
}
LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }

inline string itoa(int x, int width = 0) {
  string res;
  if(x == 0) res.push_back('0');
  while(x) {
    res.push_back('0' + x % 10);
    x /= 10;
  }
  while((int)res.size() < width) res.push_back('0');
  reverse(res.begin(), res.end());
  return res;
}
const int _B = 131072;
char buf[_B];
int _bl = 0;
inline void flush() {
	fwrite(buf, 1, _bl, stdout);
	_bl = 0;
}
__inline void _putchar(char c) {
	if(_bl == _B) flush();
	buf[_bl++] = c;
}
inline void print(LL x, char c) {
	static char tmp[20];
	int l = 0;
	if(!x) tmp[l++] = '0';
	else {
		while(x) {
			tmp[l++] = x % 10 + '0';
			x /= 10;
		}
	}
	for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);
	_putchar(c);
}
struct P {
	D x, y;
};
const int N = 300033;
const int LOG = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 7;
int n, m;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int L = 1024;
LL cnt[L], ca[L], cb[L];
int main() {
	int n, m, k;
	scanf("%d%d%d", &n, &m, &k);
	int cur = 0;
	cnt[0] = 1;
	for(int i = 0; i < n; i++) {
		int x;
		scanf("%d", &x);
		cur ^= x;
		cnt[cur]++;
	}
	for(int i = 0; i < L; i++) {
		for(int j = i + 1; j < L; j++) {
			ca[i ^ j] += (LL)cnt[i] * cnt[j];
		}
		ca[0] += (LL)cnt[i] * (cnt[i] - 1) / 2;
	}
	cur = 0;
	memset(cnt, 0, sizeof(cnt));
	cnt[0] = 1;
	for(int i = 0; i < m; i++) {
		int x;
		scanf("%d", &x);
		cur ^= x;
		cnt[cur]++;
	}
	for(int i = 0; i < L; i++) {
		for(int j = i + 1; j < L; j++) {
			cb[i ^ j] += (LL)cnt[i] * cnt[j];
		}
		cb[0] += (LL)cnt[i] * (cnt[i] - 1) / 2;
	}
LL ans = 0;
	for(int i = 0; i < L; i++) {
		for(int j =0 ; j < L; j++) {
			if((i ^ j) == k) {
				ans += (LL)ca[i] % mod * cb[j] % mod;
				ans %= mod;
			}
		}
	}
	cout << ans << endl;
}