#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
signed main(){
    int N,M,K;
    cin>>N>>M>>K;
    vector<int> A(N),B(M);
    uint32_t a=0;
    map<uint32_t,int> C,D,E,F;
    C[0]++,D[0]++;
    for(int &i:A){
        cin>>i;
        a^=i;
        C[a]=(C[a]+1)%mod;
    }
    a=0;
    for(int &i:B){
        cin>>i;
        a^=i;
        D[a]=(D[a]+1)%mod;
    }
    if(C.size()==1 && D.size()==1){
        if(K!=0)puts("0");
        else cout<<(N*(N-1)/2%mod+N)%mod*((M*(M-1)/2%mod+M)%mod)%mod<<endl;
        return 0;
    }
    for(pair<uint32_t,int> p1:C){
        for(pair<uint32_t,int> p2:C){
            if(p1<p2)E[p1.first^p2.first]=(E[p1.first^p2.first]+p1.second*p2.second%mod)%mod;
        }
    }
    for(pair<uint32_t,int> p1:D){
        for(pair<uint32_t,int> p2:D){
            if(p1<p2)F[p1.first^p2.first]=(F[p1.first^p2.first]+p1.second*p2.second%mod)%mod;
        }
    }
    int ans=0;
    for(pair<uint32_t,int> p:E)ans=(ans+p.second*F[p.first^K]%mod)%mod;
    cout<<ans<<endl;
}