#include #ifdef DEBUG #include #else #define dump(...) #endif /** * @title Modint * @docs mint.md */ template class ModInt{ public: constexpr static uint32_t MOD = M; uint64_t val; constexpr ModInt(): val(0){} constexpr ModInt(int64_t n){ if(n >= M) val = n % M; else if(n < 0) val = n % M + M; else val = n; } constexpr auto operator+(const ModInt &a) const {return ModInt(val + a.val);} constexpr auto operator-(const ModInt &a) const {return ModInt(val - a.val);} constexpr auto operator*(const ModInt &a) const {return ModInt(val * a.val);} constexpr auto operator/(const ModInt &a) const {return ModInt(val * a.inv().val);} constexpr auto& operator=(const ModInt &a){val = a.val; return *this;} constexpr auto& operator+=(const ModInt &a){if((val += a.val) >= M) val -= M; return *this;} constexpr auto& operator-=(const ModInt &a){if(val < a.val) val += M; val -= a.val; return *this;} constexpr auto& operator*=(const ModInt &a){(val *= a.val) %= M; return *this;} constexpr auto& operator/=(const ModInt &a){(val *= a.inv().val) %= M; return *this;} constexpr bool operator==(const ModInt &a) const {return val == a.val;} constexpr bool operator!=(const ModInt &a) const {return val != a.val;} constexpr auto& operator++(){*this += 1; return *this;} constexpr auto& operator--(){*this -= 1; return *this;} constexpr auto operator++(int){auto t = *this; *this += 1; return t;} constexpr auto operator--(int){auto t = *this; *this -= 1; return t;} constexpr static ModInt power(int64_t n, int64_t p){ if(p < 0) return power(n, -p).inv(); int64_t ret = 1, e = n % M; for(; p; (e *= e) %= M, p >>= 1) if(p & 1) (ret *= e) %= M; return ret; } constexpr static ModInt inv(int64_t a){ int64_t b = M, u = 1, v = 0; while(b){ int64_t t = a / b; a -= t * b; std::swap(a,b); u -= t * v; std::swap(u,v); } u %= M; if(u < 0) u += M; return u; } constexpr static auto frac(int64_t a, int64_t b){return ModInt(a) / ModInt(b);} constexpr auto power(int64_t p) const {return power(val, p);} constexpr auto inv() const {return inv(val);} friend constexpr auto operator-(const ModInt &a){return ModInt(-a.val);} friend constexpr auto operator+(int64_t a, const ModInt &b){return ModInt(a) + b;} friend constexpr auto operator-(int64_t a, const ModInt &b){return ModInt(a) - b;} friend constexpr auto operator*(int64_t a, const ModInt &b){return ModInt(a) * b;} friend constexpr auto operator/(int64_t a, const ModInt &b){return ModInt(a) / b;} friend std::istream& operator>>(std::istream &s, ModInt &a){s >> a.val; return s;} friend std::ostream& operator<<(std::ostream &s, const ModInt &a){s << a.val; return s;} template static auto div(){ static auto value = inv(N); return value; } explicit operator int32_t() const noexcept {return val;} explicit operator int64_t() const noexcept {return val;} }; using mint = ModInt<1000000007>; int main(){ std::cin.tie(0); std::ios::sync_with_stdio(false); int N, M, K; std::cin >> N >> M >> K; std::vector a(N), b(M); for(int i = 0; i < N; ++i) std::cin >> a[i]; for(int i = 0; i < M; ++i) std::cin >> b[i]; std::vector sa(N + 1), sb(M + 1); for(int i = 0; i < N; ++i) sa[i + 1] = sa[i] ^ a[i]; for(int i = 0; i < M; ++i) sb[i + 1] = sb[i] ^ b[i]; std::vector ca(1024), cb(1024); { std::vector temp(1024); temp[0] = 1; for(int j = 0; j < N; ++j){ auto x = sa[j + 1]; for(int i = 0; i < 1024; ++i){ ca[i ^ x] += temp[i]; } temp[x] += 1; } } { std::vector temp(1024); temp[0] = 1; for(int j = 0; j < M; ++j){ auto x = sb[j + 1]; for(int i = 0; i < 1024; ++i){ cb[i ^ x] += temp[i]; } temp[x] += 1; } } mint ans = 0; for(int i = 0; i < 1024; ++i){ ans += (mint)ca[i] * cb[K ^ i]; } std::cout << ans << "\n"; return 0; }