#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M,K;
	cin>>N>>M>>K;
	vector<ll> p((1<<10));
	p[0]++;
	int a=0,b=0;
	rep(i,N) cin>>a,b^=a,p[b]++;
	vector<ll> q((1<<10));
	q[0]++;
	b=0;
	rep(i,M) cin>>a,b^=a,q[b]++;
	int L=(1<<10);
	vector<ll> A(L),B(L);
	rep(i,L) rep(j,i+1){
		if(j==i){
			A[0]+=(p[i]*(p[i]-1))/2;
			B[0]+=(q[i]*(q[i]-1))/2;
		}else A[i^j]+=p[i]*p[j],B[i^j]+=q[i]*q[j];
	}
	ll ans=0;
	rep(i,L) ans=(ans+A[i]*B[i^K])%mod;
	cout<<ans<<"\n";
}