/* -*- coding: utf-8 -*-
 *
 * 1210.cc:  No.1210 XOR Grid - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_X = 60;
const int MOD = 1000000007;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

ll as[MAX_N], bs[MAX_N];
int acs[2], bcs[2];

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  int h, w, x;
  scanf("%d%d%d", &h, &w, &x);
  for (int i = 0; i < h; i++) scanf("%lld", as + i);
  for (int i = 0; i < w; i++) scanf("%lld", bs + i);

  ll xa = 0, xb = 0;
  for (int i = 0; i < h; i++) xa ^= as[i];
  for (int i = 0; i < w; i++) xb ^= bs[i];
  
  if (xa == xb) {
    int hwx = (ll)(h - 1) * (w - 1) % (MOD - 1) * x % (MOD - 1);
    printf("%d\n", powmod(2, hwx));
  }
  else
    puts("0");

  return 0;
}