import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
mod = 10 ** 9 + 7


class Combination:
    """
    SIZEが10**6程度以下の二項係数を何回も呼び出したいときに使う
    使い方:
    comb = Combination(SIZE, MOD)
    comb(10, 3) => 120
    """

    def __init__(self, N, MOD=10 ** 9 + 7):
        self.MOD = MOD
        self.__make_factorial_list(N)

    def __call__(self, n, k):
        if k < 0 or k > n:
            return 0
        res = self.fact[n] * self.inv[k] % self.MOD
        res = res * self.inv[n - k] % self.MOD
        return res

    def nPk(self, n, k):
        if k < 0 or k > n:
            return 0
        return self.fact[n] * self.inv[n - k] % self.MOD

    def nHk(self, n, k):
        if k == 0:
            return 1
        return self.__call__(n + k - 1, k)

    def __make_factorial_list(self, N):
        self.fact = [1] * (N + 1)
        self.inv = [1] * (N + 1)
        MOD = self.MOD
        for i in range(1, N + 1):
            self.fact[i] = (self.fact[i - 1] * i) % MOD
        self.inv[N] = pow(self.fact[N], MOD - 2, MOD)
        for i in range(N, 0, -1):
            self.inv[i - 1] = (self.inv[i] * i) % MOD
        return


comb = Combination(3 * 10 ** 5, mod)
N, M, X = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if N < M:
    N, M = M, N
    A, B = B, A

cnt = 0
for i in range(0, N + 1, 2):
    cnt += comb(N, i)
    cnt %= mod


ans = 1
for _ in range(X):
    ma = [a % 2 for a in A]
    mb = [b % 2 for b in B]

    if (sum(ma) + sum(mb)) % 2 == 1:
        ans = 0
        break

    ans *= pow(cnt, M - 1, mod)
    ans %= mod

    A = [a//2 for a in A]
    B = [b//2 for b in B]

print(ans)