#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

template<int mod> struct ModInt{
    long long x=0; 
    constexpr ModInt(long long x=0):x((x%mod+mod)%mod){}
    constexpr ModInt operator+(const ModInt& r)const{return ModInt(*this)+=r;}
    constexpr ModInt operator-(const ModInt& r)const{return ModInt(*this)-=r;}
    constexpr ModInt operator*(const ModInt& r)const{return ModInt(*this)*=r;}
    constexpr ModInt operator/(const ModInt& r)const{return ModInt(*this)/=r;}
    constexpr ModInt& operator+=(const ModInt& r){ if((x+=r.x)>=mod) x-=mod; return *this;}
    constexpr ModInt& operator-=(const ModInt& r){ if((x-=r.x)<0) x+=mod; return *this;}
    constexpr ModInt& operator*=(const ModInt& r){ if((x*=r.x)>=mod) x%=mod; return *this;}
    constexpr ModInt& operator/=(const ModInt& r){ return *this*=r.inv();}
    ModInt inv() const {
        long long s=x,sx=1,sy=0,t=mod,tx=0,ty=1;
        while(s%t!=0){
            long long temp=s/t,u=s-t*temp,ux=sx-temp*tx,uy=sy-temp*ty;
            s=t;sx=tx;sy=ty;
            t=u;tx=ux;ty=uy;
        }
        return ModInt(tx);
    }
    ModInt pow(long long n) const {
        ModInt a=1;
        while(n>0){
            if(n&1) a*=*this;
            *this*=*this;
            n>>=1;
        }
        return a;
    }
    friend constexpr ostream& operator<<(ostream& os,const ModInt<mod>& a) {return os << a.x;}
    friend constexpr istream& operator>>(istream& is,ModInt<mod>& a) {return is >> a.x;}
};
using mint = ModInt<MOD>;

int main(){
    int n,m,k;
    cin >> n >> m >> k;
    vector<int> a(n),b(m);
    vector<mint> cnta(1500),cntb(1500),alla(1500),allb(1500);
    rep(i,n) cin >> a[i];
    rep(i,m) cin >> b[i];
    rep(i,n-1) a[i+1] ^= a[i];
    rep(i,m-1) b[i+1] ^= b[i];
    rep(i,n) cnta[a[i]] +=1;
    rep(i,m) cntb[b[i]] +=1;
    cnta[0]+=1;
    cntb[0]+=1;

    rep(i,1500)rep(j,i+1){
        if(i==j){
            alla[0] += (cnta[i] * (cnta[j]-1)) / 2;
            allb[0] += (cntb[i] * (cntb[j]-1)) / 2;
        }
        else if((i^j)<1500){
            alla[i^j] += cnta[i] * cnta[j];
            allb[i^j] += cntb[i] * cntb[j];
        }
    }
    /*
    rep(i,n) cout << a[i] << " " ;cout << endl;
    rep(i,m) cout << b[i] << " " ;cout << endl;

    rep(i,30) cout << cnta[i] << " " ;cout << endl;
    rep(i,30) cout << cntb[i] << " " ;cout << endl;

    rep(i,30) cout << alla[i] << " " ;cout << endl;
    rep(i,30) cout << allb[i] << " " ;cout << endl;
    */

    mint ans = 0;
    rep(i,1500)rep(j,1500){
        if((i^j)==k) ans += alla[i] * allb[j];
    }
    cout << ans << endl;

    return 0;
}