/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
ll power(ll x, ll n){
    if(n == 0) return 1LL;
    ll res = power(x * x % MOD, n/2);
    if(n % 2 == 1) res = res * x % MOD;
    return res;
}

void solve(){
    ll N,M,K;
    cin >> N >> M >> K;
    ll a[200010], b[200010];
    rep(i,0,N) cin >> a[i];
    rep(i,0,M) cin >> b[i];
    map<ll,ll> xor_a, xor_b;
    xor_a[0]++;
    ll cur = 0;
    rep(i,0,N){
        cur ^= a[i];
        xor_a[cur]++;
    }
    map<ll,ll> val_a;
    for(auto &e: xor_a){
        for(auto &f: xor_a){
            if(e.first == f.first){
                ll p = e.second * (f.second-1);
                val_a[0] += p;
                val_a[0] %= MOD;
            }else{
                ll p = e.second * f.second;
                val_a[e.first^f.first] += p;
                val_a[e.first^f.first] %= MOD;
            }
        }
    }
    // for(auto &e: val_a){
    //     print(e.first, e.second/2);
    // }
    cur = 0;
    xor_b[0]++;
    rep(i,0,M){
        cur ^= b[i];
        xor_b[cur]++;
    }
    map<ll,ll> val_b;
    for(auto &e: xor_b){
        for(auto &f: xor_b){
            if(e.first == f.first){
                ll p = e.second * (f.second-1);
                val_b[0] += p;
                val_b[0] %= MOD;
            }else{
                ll p = e.second * f.second;
                val_b[e.first^f.first] += p;
                val_b[e.first^f.first] %= MOD;
            }
        }
    }
    // print("~~");
    // for(auto &e: val_b){
    //     print(e.first, e.second/2);
    // }
    ll ans = 0;
    for(auto &e: val_a){
        for(auto &f: val_b){
            if((e.first^f.first) == K){
                // print(e.first);
                ans += e.second * f.second;
                ans %= MOD;
            }
        }
    }
    print(ans * power(4,MOD-2) % MOD);
    

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}