//g++ t2.cpp -o t2 && t2 < p.txt

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <functional>
#include <set>
#include <map>
#define DB cerr<<"D"<<endl
#define pb push_back
using namespace std; using ll=long long; using ld=long double; const int INF=1e9; const ll LINF=1e18; const double dINF = 1e18; const ld ldINF = 1e18; const double EPS = 1e-6;
template<typename T, typename U, typename O> void caut(T a, U b, O c){cout<<"("<<a<<","<<b<<","<<c<<") ";} template<typename T, typename U> void caut(T a, U b){cout<<"("<<a<<","<<b<<") ";} template<typename T> void caut(T a){cout<<"("<<a<<") ";}
using P=pair<int,int>;
const ll M = 1e9+7, mx = 200000;
void add(ll& x, ll y) {x+=y; x%=M;}; void mul(ll& x, ll y) {x*=y; x%=M;}; void chmax(ll& x, ll y) {if (x<y) x=y;}; void chmin(ll& x, ll y) {if (x>y) x=y;};
const ll A = 3;

int main() {
  int n,m,k; cin>>n>>m>>k;
  int a[n],b[m];
  for(int i=0;i<n;i++) cin>>a[i];
  for(int i=0;i<m;i++) cin>>b[i];

  ll c[1024]={1,0},d[1024]={},sm=0;
  for(int i=0;i<n;i++) {
    sm^=a[i];
    for(int j=0;j<1024;j++) {
      d[sm^j] += c[j]; d[sm^j] %= M; 
    }
    c[sm]++;
  }

  ll e[1024]={1,0},f[1024]={}; sm=0;
  for(int i=0;i<m;i++) {
    sm^=b[i];
    for(int j=0;j<1024;j++) {
      f[sm^j] += e[j]; f[sm^j] %= M; 
    }
    e[sm]++;
  }
  
  ll an = 0;
  for(int i=0;i<1024;i++) {
    an += d[i] * f[k^i];
    an %= M;
  }
  cout<<an<<endl;
}