#include <iostream>

using namespace std;
typedef long long ll;
ll a[200010],b[200010],mod = 1000000007;
ll pw(ll a, ll x){
    ll ret = 1;
    while(x){
        if(x&1) (ret *= a) %= mod;
        x /= 2; (a *= a) %= mod;
    }
    return ret;
}

int cnt[60] = {};
int main(){
    ll i,n,m,x; cin >> n >> m >> x;
    for(i=0;i<n;i++){
        cin >> a[i];
        int d = 0;
        while(a[i]){
            cnt[d] += a[i]&1; a[i] /= 2; d++;
        }
    }
    for(i=0;i<m;i++){
        cin >> b[i];
        int d = 0;
        while(b[i]){
            cnt[d] += b[i]&1; b[i] /= 2; d++;
        }
    }
    for(i=0;i<x;i++){
        if(cnt[i]&1){
            cout << 0 << endl;
            return 0;
        }
    }
    ll ans = pw(2,(n - 1)*(m - 1));
    ans = pw(ans,x);
    cout << ans << endl;
}