#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>

using namespace std;

#define int long long
#define endl "\n"

constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007; 

struct fast_io {
	fast_io(){
		std::cin.tie(nullptr);
		std::ios::sync_with_stdio(false);
	};
} fio;

long long power(long long x, long long n){
	long long ans = 1;
	for(;n;n >>= 1ll, x *= x, ans %= MOD, x %= MOD)
		if(n&1ll)ans*=x;
	return ans % MOD;
}

	
signed main(){
	cout<<fixed<<setprecision(10);
	
	
	
	int N, M, X;
	vector<int> A, B;
	
	cin>>N>>M>>X;
	
	A.resize(N);
	B.resize(M);
	
	
	
	for(int i = 0; i < N; i++){
		cin>>A[i];
	}
	
	for(int j = 0; j < M; j++){
		cin>>B[j];
	}
	
	if(N == 1 && M == 1) {
		if(A[0] == B[0]) cout<<1<<endl;
		else cout<<0<<endl;
	} else if(N == 1) {
		int XOR = 0;
		
		for(int i = 0; i < M; i++){
			XOR ^= B[i];
		}
		
		if(XOR == A[0]) cout<<1<<endl;
		else cout<<0<<endl;
		
	} else if(M == 1){
		int XOR = 0;
		
		for(int i = 0; i < N; i++){
			XOR ^= A[i];
		}
		
		if(XOR == B[0]) cout<<1<<endl;
		else cout<<0<<endl;
	} else {
		int XORA = 0;
		
		for(int i = 0; i < N; i++){
			XORA ^= A[i];
		}
		int XORB = 0;
		
		for(int i = 0; i < M; i++){
			XORB ^= B[i];
		}
		if(XORB == XORA)cout<<power(2, (N-1) * (M-1) * X) % MOD<<endl;
		else cout<<0<<endl;
	}
	return 0;
}