#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << #x << ':' << x << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }

constexpr ll mod = 1000000007;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	int n, m, k;
	cin >> n >> m >> k;
	vector<int> a(n), b(n);
	rep(i, n) cin >> a[i]; rep(i, n) cin >> b[i];
	vector<ll> x(1024), y(1024), cntx(1024), cnty(1024);
	cntx[0] = cnty[0] = 1;
	int curx = 0, cury = 0;
	rep(i, n) {
		curx ^= a[i];
		rep(j, 1024) {
			x[j] += cntx[j ^ curx];
		}
		cntx[curx]++;
	}
	rep(i, m) {
		cury ^= b[i];
		rep(j, 1024) {
			y[j] += cnty[j ^cury];
		}
		cnty[cury]++;
	}
	rep(i, 1024) x[i] %= mod, y[i] %= mod;
	ll ans = 0;
	rep(i, 1024) ans += x[i] * y[i ^ k] % mod;
	cout << ans % mod << '\n';
}