#include using namespace std; using lnt = long long; using Real = long double; #define ALL(obj) (obj).begin(),(obj).end() #define RALL(obj) (obj).rbegin(),(obj).rend() #define REP(i, n) for(lnt i=0;i<(n);++i) #define RANGE(i, a, b) for(lnt i=(a);i<(b);++i) #define RREP(i, n) for(lnt i=(n)-1;i>= 0;--i) #define ln '\n' #define pb push_back #define eb emplace_back #define pque priority_queue #define umap unordered_map #define uset unordered_set #define dcout cout< inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;} template inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;} template inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} template inline T nHr(T a,T b){return nCr(a+b-1,b);} template inline bool chmax(T& a,T b){if(a inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;} using pint = pair; using plnt = pair; using vint = vector; using vlnt = vector; constexpr lnt MOD = 1e9+7; int main(){ summon_tourist; lnt N, M, K, A[200010], B[200010]; A[0] = 0, B[0] = 0; cin >> N >> M >> K; REP(i, N) cin >> A[i+1]; REP(i, M) cin >> B[i+1]; REP(i, N) A[i+1] ^= A[i]; REP(i, M) B[i+1] ^= B[i]; map aa, bb; REP(i, N+1) aa[A[i]]++; REP(i, M+1) bb[B[i]]++; lnt ans = 0; REP(ka, 1024){ lnt kb = K xor ka; lnt cnta = 0, cntb = 0; REP(kaa, 1024){ if(ka == 0) cnta += (aa[kaa] * (aa[(ka xor kaa)]-1)) % MOD; else cnta += (aa[kaa] * aa[(ka xor kaa)]) % MOD; cnta %= MOD; } cnta *= 500000004; cnta %= MOD; REP(kab, 1024){ if(kb == 0) cntb += (bb[kab] * (bb[(kb xor kab)]-1)) % MOD; else cntb += (bb[kab] * bb[(kb xor kab)]) % MOD; cntb %= MOD; } cntb *= 500000004; cntb %= MOD; ans += (cnta*cntb) % MOD; ans %= MOD; } // 0 1 3 0 // 0 3 7 2 cout << ans << ln; }