#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll inf=1e9+7;
const ll mod=1e9+7;
const int MAX=200010;

ll rui(ll a,ll b){
    ll res=1;
    ll x=a;
    while(b){
        if(b&1)res=res*x%mod;
        b/=2;
        x=x*x%mod;
    }
    return res;
}

signed main(){
    ll n,m,x;cin>>n>>m>>x;
    vector<ll>a(n),b(m);
    rep(i,n)cin>>a[i];
    rep(i,m)cin>>b[i];
    if(n==1){
        ll B=0;
        rep(i,m){
            B^=b[i];
        }
        if(a[0]!=B){
            cout<<0<<endl;
        }else{
            cout<<1<<endl;
        }
    }else if(m==1){
        ll A=0;
        rep(i,n){
            A^=a[i];
        }
        if(A!=b[0]){
            cout<<0<<endl;
        }else{
            cout<<1<<endl;
        }
    }else{
        ll d=rui(2LL,(n-1)*(m-1))%mod;
        ll ans=rui(d,x);
        if(ans<0)ans+=mod;
        cout<<ans<<endl;
    }
}