#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';

const int N = 2e5+7, C = 1 << 10, MOD = 1000 * 1000 * 1000 + 7;

vector <int> solve(int n) {
    vector <int> cur(C), ans(C);
    cur[0] = 1;

    int p = 0;
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;

        p ^= x;

        for (int l = 0; l < C; ++l) {
            ans[l ^ p] += cur[l];
            if (ans[l ^ p] >= MOD)
                ans[l ^ p] -= MOD;
        }

        ++cur[p];

    }   
    return ans;
}   

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n, m, k;
    cin >> n >> m >> k;
    
    vector <int> a = solve(n);
    vector <int> b = solve(m);

    int ans = 0;
    for (int i = 0; i < C; ++i) {
        int j = k ^ i;
        ans += a[i] * b[j];
        ans %= MOD;
    }   
    cout << ans << endl;
}