#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 2000000000000000000
int N,M;
long long X;
int beki(long long a,long long b,int M = modulo){
	int x = 1;
	while(b!=0){
		if(b&1){
			x=((long long)x*a)%M;
		}
		a=((long long)a*a)%M;
		b>>=1;
	}
	return x;
}
int main(){
	
	cin>>N>>M;
	cin>>X;
	
	vector<long long> A(N),B(M);
	
	for(int i=0;i<N;i++)scanf("%lld",&A[i]);
	for(int i=0;i<M;i++)scanf("%lld",&B[i]);
	
	long long ans = 1LL;
	long long K = ((long long)N-1)*((long long)M-1);

	for(int i=0;i<X;i++){
		vector<long long> a(N),b(M);
		int sum = 0;
		for(int j=0;j<N;j++){
			a[j] = (A[j]>>i)&1;
			sum += a[j];
		}
		for(int j=0;j<M;j++){
			b[j] = (B[j]>>i)&1;
			sum += b[j];
		}
		
		if(sum%2==1)ans = 0LL;
		else{
			ans = mod(ans * beki(2,K));
		}
		
	}
	
	cout<<ans<<endl;
	
	return 0;
}