#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, N) for (int i = 0; i < (int)(N); ++i)
#define rrep(i, N) for (int i = (int)(N)-1; i >= 0; --i)
#define debug(x) cout << #x << "=" << x << endl;
constexpr int MOD=1000000007;
constexpr ll INF = (1LL << 61) - 1;
template <class T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}
template <class T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;} return false;}
template <typename T> void fail(T v){cout << v << endl;exit(0);}
//template

void solve(){
    int N,M,K;scanf("%d %d %d",&N,&M,&K);
    int A[201010],B[201010],S[201010],ct[1<<10];ll D[1<<10];
    memset(ct,0,sizeof(ct));
    memset(D,0,sizeof(D));
    S[0]=0;
    rep(i,N){scanf("%d",&A[i]);S[i+1]=S[i]^A[i];ct[S[i+1]]++;}
    rep(i,N){
        rep(j,1<<10){D[j^S[i]]+=ct[j];}
        ct[S[i+1]]--;
    }
    memset(ct,0,sizeof(ct));
    rep(i,M){scanf("%d",&B[i]);S[i+1]=S[i]^B[i];ct[S[i+1]]++;}
    ll res=0;
    rep(i,M){
        rep(j,1<<10){res+=D[j^S[i]^K]*ct[j];if(res>=MOD)res%=MOD;}
        ct[S[i+1]]--;
    }
    cout<<res<<endl;
}

int main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    //cout << fixed << setprecision(20);
    solve();
    return 0;
}