#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <limits>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <utility>
#include <array>
#include <random>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
using namespace std;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << " [" << __LINE__ << ":" << __FUNCTION__ << "] " << endl;
// vector出力
template < typename T >
ostream &operator<<(ostream &os, vector< T > &v) {
    os << "{";
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i < v.size() - 1 ? ", " : "");
    }
    os << "}";
    return os;
}
// pair出力
template < typename T, typename U >
ostream &operator<<(ostream &os, pair< T, U > &p) {
    return os << "(" << p.first << ", " << p.second << ")";
}
// map出力
template < typename T, typename U >
ostream &operator<<(ostream &os, map< T, U > &map_var) {
    os << "{";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if (itr != map_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
// set 出力
template < typename T >
ostream &operator<<(ostream &os, set< T > &set_var) {
    os << "{";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr;
        ++itr;
        if (itr != set_var.end()) os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#pragma endregion

/////////////////////////////////////////

template < int MOD >
struct mint {
public:
    long long x;
    mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    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) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-() const {
        return mint() -= *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;
    }
    friend std::ostream &operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    friend std::istream &operator>>(std::istream &is, mint &n) {
        long long x;
        is >> x;
        n = mint(x);
        return is;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
    mint pow(long long k) const {
        mint ret = 1;
        mint p = this->x;
        while (k > 0) {
            if (k & 1) {
                ret *= p;
            }
            p *= p;
            k >>= 1;
        }
        return ret;
    }
};

int main() {
    int n, m, x;
    cin >> n >> m >> x;
    vector< ll > a(n), b(m);
    constexpr int MOD = 1e9 + 7;
    ll S = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        S ^= a[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
        S ^= b[i];
    }
    if (n != 1 && m != 1) {
        if (S == 0) cout << mint< MOD >(2).pow((ll)x * (n - 1) * (m - 1)) << endl;
        else cout << mint< MOD >(2).pow((ll)x * (n - 1) * (m - 1) - x) << endl;
    } else if (n == 1 && m == 1) {
        if (a[0] == b[0]) cout << 1 << endl;
        else
            cout << 0 << endl;
    } else if (n == 1) {
        for (int i = 0; i < m; i++) {
            a[0] ^= b[i];
        }
        if (a[0] == 0) cout << 1 << endl;
        else
            cout << 0 << endl;
    } else {
        for (int i = 0; i < n; i++) {
            b[0] ^= a[i];
        }
        if (b[0] == 0) cout << 1 << endl;
        else
            cout << 0 << endl;
    }
    return 0;
}

/////////////////////////////////////////