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

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= 0; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

void read(){}
template<class Head, class... Tail> void read(Head& head, Tail&... tail){cin >> head;read(tail...);}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

void calc(vector<int> &a,vector<ll> &a_id,vector<ll> &a_nm,int n){
    int xsum=0;
    rep(i,n){
        xsum^=a[i];
        a_id[xsum]++;
    }
    a_nm = a_id;
    rep(i,1024){
        REP(j,i,1024){
            ll t=a_id[i]*a_id[j];
            ll xo=i^j;
            if(j==i)t-=((a_id[i]+1)*a_id[i])/2;
            a_nm[xo]=(a_nm[xo]+t)%MD;
        }
    }
}

int main()
{
    int n,m,k;
    read(n,m,k);
    vector<int> a,b;
    a.resize(n);
    b.resize(m);
    rep(i,n)read(a[i]);
    rep(i,m)read(b[i]);
    vector<ll> a_id,a_nm;
    a_id.resize(1100),a_nm.resize(1100);
    calc(a,a_id,a_nm,n);
    //writes(a_nm);
    vector<ll> b_id,b_nm;
    b_id.resize(1100),b_nm.resize(1100);
    calc(b,b_id,b_nm,m);
    //writes(b_nm);
    ll res=0;
    rep(i,1024){
        rep(j,1024){
            ll t=a_nm[i]*b_nm[j];
            ll xo=i^j;
            if(xo==k)res=(res+t)%MD;
        }
    }
    write(res);
    return 0;
}

// GCC reference:
//   https://gcc.gnu.org/

// C++ language references:
//   https://cppreference.com/
//   https://isocpp.org/
//   http://www.open-std.org/jtc1/sc22/wg21/

// Boost libraries references:
//   https://www.boost.org/doc/