#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define PI 3.141592653589793

ll modpow(ll a, ll n, ll p){
	if(n==0) return 1;
	if(n%2) return (a*modpow(a, n-1, p))%p;
	if(!(n%2)){
		ll t=modpow(a, n/2, p);
		return (t*t)%p;
	}
}



int main(){
  ll n, m, x; cin >> n >> m >> x; ll a[n], b[m];
  ll tate=0, yoko=0;
  rep(i, n){
    cin >> a[i]; tate^=a[i];
  }
  rep(i, m){
    cin >> b[i]; yoko^=b[i];
  }
  if(tate!=yoko){
    cout << 0 << endl; 
  }
  else{
    cout << (ll)modpow(2, (m-1)*(n-1)*x, mod)%mod << endl;
  }
}