#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

const int L=(1<<10);

int main(){
  int N,M,K;
  scanf("%d%d%d",&N,&M,&K);
  vector<int> A(N),B(M);
  rep(i,N){
    scanf("%d",&A[i]);
  }
  rep(i,M){
    scanf("%d",&B[i]);
  }

  vector<ll> cnt(L,0),dpb(L,0);
  int crt=0;
  cnt[0]++;
  rep(i,M){
    crt^=B[i];
    rep(S,L){
      dpb[S]+=cnt[S^crt];
    }
    cnt[crt]++;
  }
  rep(S,L)dpb[S]%=mod;

  vector<ll> dpa(L,0);
  cnt.clear();
  cnt.resize(L,0);
  crt=0;
  cnt[0]++;
  rep(i,N){
    crt^=A[i];
    rep(S,L){
      dpa[S]+=cnt[S^crt];
    }
    cnt[crt]++;
  }
  rep(S,L)dpa[S]%=mod;

  ll ans=0;
  rep(a,L)rep(b,L){
    if((a^b)==K){
      (ans+=(dpa[a]*dpb[b])%mod)%=mod;
    }
  }
  cout<<ans<<endl;

  return 0;
}