#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n, m, k;std::cin >> n >> m >> k;
  //鳩の巣よりそれぞれ2^10種類
  vector<ll> a(n), b(m);
  vector<ll> x(1024, 0), y(1024, 0);
  vector<ll> cnt1(1024, 0), cnt2(1024, 0);

  x[0] = y[0] = 1;
  ll now = 0;
  for(int i=0;i<n;i++){
    ll t;std::cin >> t;
    now^=t;
    x[now]++;
  }
  now = 0;
  for(int i=0;i<m;i++){
    ll t;std::cin >> t;
    now^=t;
    y[now]++;
  }
  ll P = 1000000007;
  for(int i=0;i<1024;i++){
    ll now = x[i];
    if(now==0) continue;
    for(int j=0;j<1024;j++){
      ll to_num = x[j];
      if(i==j) to_num--;
      cnt1[i^j] += now * to_num;
    }
  }
  for(int i=0;i<1024;i++){
    ll now = y[i];
    if(now==0) continue;
    for(int j=0;j<1024;j++){
      ll to_num = y[j];
      if(i==j) to_num--;
      cnt2[i^j] += now * to_num;
    }
  }
  for(int i=0;i<1024;i++) cnt1[i]/=2, cnt2[i]/=2;
  for(int i=0;i<1024;i++) cnt1[i]%=P, cnt2[i]%=P; 
  ll ans = 0;
  for(int i=0;i<1024;i++){
    ll need = k^i;
    ans = (ans + (cnt1[i] * cnt2[need])%P)%P;
  }
  std::cout << ans << '\n';
}