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

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

template <class T, class Op = multiplies<T>>
constexpr T power(T a, long long n, Op op = Op(), T e = {1}) {
  assert(n >= 0);
  while (n) {
    if (n & 1) e = op(e, a);
    if (n >>= 1) a = op(a, a);
  }
  return e;
}

template <unsigned M> struct modular {
  using m = modular;
  static constexpr unsigned mod = M;
  unsigned v;
  modular(long long x = 0) : v((x %= mod) < 0 ? x + mod : x) {}
  m operator-() const { return m() -= *this; }
  m& operator+=(m b) { if ((int)(v += b.v - mod) < 0) v += mod; return *this; }
  m& operator-=(m b) { if ((int)(v -= b.v) < 0) v += mod; return *this; }
  m& operator*=(m b) { v = (uint64_t)v * b.v % mod; return *this; }
  m& operator/=(m b) { return *this *= power(b, mod - 2); }
  friend m operator+(m a, m b) { return a += b; }
  friend m operator-(m a, m b) { return a -= b; }
  friend m operator*(m a, m b) { return a *= b; }
  friend m operator/(m a, m b) { return a /= b; }
  friend bool operator==(m a, m b) { return a.v == b.v; }
};

using mint = modular<power(10, 9) + 7>;

using ll = long long;

vector<ll> f(const vector<int>& a) {
  int n = size(a);
  vector<int> cum(n + 1);
  for (int i = n; i--; ) {
    cum[i] = a[i] ^ cum[i + 1];
  }
  vector<ll> res(1024), cur(1024);
  for (auto e : cum) {
    for (int i = 0; i < 1024; ++i) {
      res[i ^ e] += cur[i];
    }
    ++cur[e];
  }
  return res;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n);
  for (auto&& e : a) cin >> e;
  vector<int> b(m);
  for (auto&& e : b) cin >> e;
  auto p = f(a), q = f(b);
  mint res;
  for (int i = 0; i < 1024; ++i) {
    res += mint(p[i]) * q[k ^ i];
  }
  cout << res.v << '\n';
}