#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

struct mint {
	long long x;
	mint(long long x = 0) :x((x% mod + mod) % mod) {}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};

ll acnt[1025], bcnt[1025];
int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    ll n, m, k; scanf("%lld %lld %lld", &n, &m, &k);
    vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
    vector<ll> b(m); for (int j = 0; j < m; j++) scanf("%lld", &b[j]);
	{
		ll cur[1024] = {};
		cur[0] = 1;
		int t = 0;
		for (int i = 0; i < n; i++) {
			t ^= a[i];
			for (int j = 0; j < 1024; j++) {
				ll p = t ^ j;
				acnt[p] += cur[j];
				if (acnt[p] >= mod) acnt[p] -= mod;
			}
	
			cur[t] += 1;
		}
	}
	{
		ll cur[1024] = {};
		cur[0] = 1;
		int t = 0;
		for (int i = 0; i < m; i++) {
			t ^= b[i];
			for (int j = 0; j < 1024; j++) {
				ll p = t ^ j;
				bcnt[p] += cur[j];
				if (bcnt[p] >= mod) bcnt[p] -= mod;
			}

			cur[t] += 1;
		}
	}
	ll res = 0;
	for (int i = 0; i < 1024; i++) {
		ll t = i ^ k;

		//cout << acnt[i] << endl;
		res += acnt[i] % mod * (bcnt[t] % mod) % mod;
		if (res >= mod) res -= mod;
	}
	cout << res << "\n";
    return 0;
}