#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

ll mod_pow(ll x,ll n){
  x%=MOD;
  ll res=1;
  while(n>0){
    if(n&1) res=res*x%MOD;
    x=x*x%MOD;
    n>>=1;
  }
  return res;
}

void add(ll &a,ll b){
  a=(a+b)%MOD;
}

void mul(ll &a,ll b){
  a%=MOD;b%=MOD;
  a=a*b%MOD;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll H,W,X;
  cin>>H>>W>>X;
  vector<ll> A(H),B(W);
  rep(i,H) cin>>A[i];
  rep(i,W) cin>>B[i];

  if(H==1){
    ll all=0;
    rep(i,W) all^=B[i];
    if(A[0]==all) cout<<1<<endl;
    else cout<<0<<endl;
    return 0;
  }
  if(W==1){
    ll all=0;
    rep(i,H) all^=A[i];
    if(B[0]==all) cout<<1<<endl;
    else cout<<0<<endl;
    return 0;
  }

  ll ans=1;
  for(ll x=0;x<X;x++){
    vector<ll> C(H,0),D(W,0);
    rep(i,H) if(A[i]&(1ll<<x)) C[i]=1;
    rep(i,W) if(B[i]&(1ll<<x)) D[i]=1;

    ll allC=0,allD=0;
    rep(i,H) allC^=C[i];
    rep(i,W) allD^=D[i];
    if(allC!=allD) ans=0;

    ll res=mod_pow(2,(H-1)*(W-1));
    mul(ans,res);
  }
  cout<<ans<<endl;

  return 0;
}