#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

ll DP1[1024], DP2[1024];

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];
  vector<ll> befarr(1024), aftarr(1024);
  for(int i=0;i<1024;++i) {
    befarr[i] = 0;
    aftarr[i] = 0;
  }
  for(int i=0;i<N;++i) {
    befarr[0]++;
    for(int j=0;j<(1<<10);++j) {
      aftarr[j^a[i]] += befarr[j];
    }
    for(int j=0;j<(1<<10);++j) {
      DP1[j] += aftarr[j];
      DP1[j] %= mod;
    }
    befarr = aftarr;
    for(int j=0;j<(1<<10);++j) aftarr[j] = 0;
  }
  for(int i=0;i<(1<<10);++i) befarr[i] = 0;
  for(int i=0;i<M;++i) {
    befarr[0]++;
    for(int j=0;j<(1<<10);++j) {
      aftarr[j^b[i]] += befarr[j];
    }
    for(int j=0;j<(1<<10);++j) {
      DP2[j] += aftarr[j];
      DP2[j] %= mod;
    }
    befarr = aftarr;
    for(int j=0;j<(1<<10);++j) aftarr[j] = 0;
  }
  ll ans = 0;
  for(int i=0;i<(1<<10);++i) {
    ans += DP1[i]*DP2[K^i]%mod;
    ans %= mod;
  }
  cout<<ans<<endl;
}