#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long co[1030] = {}, co1[1030] = {};
long long ca[1030] = {}, cb[1030] = {};
long long mod = 1000000007, z = 0;
int main() {
	int n, m, k;
	cin >> n >> m >> k;
	int a = 0, b = 0;
	co[0] = 1, co1[0] = 1;
	for (int i = 0; i < n; i++) {
		int a1;
		cin >> a1;
		a ^= a1;
		co[a]++;
	}
	for (int i = 0; i < m; i++) {
		int b1;
		cin >> b1;
		b ^= b1;
		co1[b]++;
	}
	for (int i = 0; i < 1024; i++) {
		for (int j = i; j < 1024; j++) {
			if (i == j) {
				ca[i ^ j] += co[i] * max(z,co[j] - 1) / 2;
				cb[i ^ j] += co1[i] * max(z, co1[j] - 1) / 2;
				ca[i ^ j] %= mod;
				cb[i ^ j] %= mod;
			}
			else {
				ca[i ^ j] += co[i] * co[j];
				cb[i ^ j] += co1[i] * co1[j];
				ca[i ^ j] %= mod;
				cb[i ^ j] %= mod;
			}
		}
	}
	long long ans = 0;
	for (int i = 0; i < 1024; i++) {
		for (int j = i; j < 1024; j++) {
			if ((i ^ j) == k) {
				if (i == j) {
					ans += ca[i] * cb[j];
					ans %= mod;
				}
				else {
					ans += ca[i] * cb[j];
					ans %= mod;
					ans += cb[i] * ca[j];
					ans %= mod;
				}
			}
		}
	}
	cout << ans << endl;
}