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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
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 nextLong() { ll x; scanf("%lld", &x); return x;}

const ll MOD = 1e9 + 7;
struct mint {
  ll x;
  mint(ll x=0):x((x%MOD+MOD)%MOD){}
  mint& operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}
  mint& operator-=(const mint a) {if ((x += MOD-a.x) >= MOD) x -= MOD;return *this;}
  mint& operator*=(const mint a) {(x *= a.x) %= MOD;return *this;}
  mint operator+(const mint a) const {mint res(*this);return res+=a;}
  mint operator-(const mint a) const {mint res(*this);return res-=a;}
  mint operator*(const mint a) const {mint res(*this);return res*=a;}
  mint pow(ll b) const {
    mint res(1), a(*this);
    while (b) {
      if (b & 1) res *= a;
      a *= a;
      b >>= 1;
    }
    return res;
  }
  // for prime MOD
  mint inv() const {return pow(MOD-2);}
  mint& operator/=(const mint a) {return (*this) *= a.inv();}
  mint operator/(const mint a) const {mint res(*this);return res/=a;}
};
ostream& operator<<(ostream& os, const mint& a) {os << a.x; return os;}


int main2() {
  int N = nextLong();
  int M = nextLong();
  int K = nextLong();
  vector<int> a(N), b(M);
  REP(i, N) a[i] = nextLong();
  REP(i, M) b[i] = nextLong();
  vector<int> A(N+1), B(M+1);
  REP(i, N) A[i+1] = A[i] ^ a[i];
  REP(i, M) B[i+1] = B[i] ^ b[i];
  vector<mint> S(1 << 10), T(1 << 10);
  REP(i, N+1) S[A[i]] += 1;
  REP(i, M+1) T[B[i]] += 1;
  vector<mint> X(1 << 10), Y(1 << 10);
  REP(s, 1<<10) REP(t, 1 << 10) {
    X[s^t] += S[s] * S[t];
    Y[s^t] += T[s] * T[t];
  }
  REP(s, 1<<10) {
    X[s] = (X[s] - (s == 0 ? (N+1) : 0)) / 2;
    Y[s] = (Y[s] - (s == 0 ? (M+1) : 0)) / 2;
  }
  mint ans = 0;
  REP(s, 1 << 10) {
    ans += X[s] * Y[s^K];
  }
  cout << ans << endl;
  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}