#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 1e18;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()

ll power(ll x, ll y) {
	if (y==0) return 1;
	else if (y==1) return x%MOD;
	else if (y%2==0) { ll pow=power(x,y/2); return (pow*pow)%MOD; } 
	else { ll pow=power(x,y/2); return ((pow*pow)%MOD)*x%MOD; }
}
ll divid(ll x, ll y) {
	return ((x%MOD)*power(y,MOD-2))%MOD;
}

int main(){
	int n, m, x; cin >> n >> m >> x;
	VI a(n), b(m);
	REP(i,n) cin >> a[i];
	REP(i,m) cin >> b[i];
	bool ok=1;
	ll ans=power(power(power(2,n-1),m-1),x)%MOD;
	REP(i,x){
		int tp=0;
		REP(j,n) tp+=(a[j]>>i)&1;
		REP(j,m) tp+=(b[j]>>i)&1;
		if(tp%2==1){
			ok=0;
			break;
		}
	}
	cout << ans*ok << endl;
	return 0;
}