#include #include #include #include #include #include #include #include #include #include #include #include #include #define repi(i,a,b) for(ll i=(a);i<(b);++i) #define rep(i,a) repi(i,0,a) #define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i) #define repd(i,a) repdi(i,a,0) #define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it ) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() using ll = long long; using P = std::pair; constexpr ll INF = 1ll<<60; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template std::ostream& operator<< ( std::ostream& out, const std::pair& a ) { std::cout << '(' << a.first << ", " << a.second << ')'; return out; } template std::ostream &operator<< ( std::ostream& out, const std::vector& a ) { std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << ", "; } std::cout << ']'; return out; } const ll mod = 1000000007; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res+=a; } mint operator-(const mint a) const { mint res(*this); return res-=a; } mint operator*(const mint a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res/=a; } }; struct combination { std::vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } }; ll N, M, K; ll a[200010], b[200010]; std::map cntA, cntB, xorA, xorB; int main() { std::cin >> N >> M >> K; rep( i, N ) std::cin >> a[i]; rep( i, N-1 ) a[i+1] ^= a[i]; rep( i, M ) std::cin >> b[i]; rep( i, M-1 ) b[i+1] ^= b[i]; cntA[0] += 1; rep( i, N ) cntA[a[i]] += 1; cntB[0] += 1; rep( i, M ) cntB[b[i]] += 1; itr( it, cntA ) for( auto it2 = it; it2 != cntA.end(); ++it2 ) { if( it->first == it2->first ) { xorA[0] += it->second*(it->second-1)/2; } else { xorA[(it->first)^(it2->first)] += it->second*it2->second; } } itr( it, cntB ) for( auto it2 = it; it2 != cntB.end(); ++it2 ) { if( it->first == it2->first ) { xorB[0] += it->second*(it->second-1)/2; } else { xorB[(it->first)^(it2->first)] += it->second*it2->second; } } mint ans = 0; itr( it, xorA ) itr( it2, xorB ) if( ((it->first)^(it2->first)) == K ) { ans += it->second*it2->second; } std::cout << ans.x << std::endl; return 0; }