package main

import (
	"bufio"
	"fmt"
	"os"
)

const MOD int = 1e9 + 7
const MAX int = 1024

func xorAndXor(nums1, nums2 []int, k int) int {
	f, g := make([]int, MAX), make([]int, MAX)
	f[0], g[0] = 1, 1
	xor := 0
	for _, num := range nums1 {
		xor ^= num
		f[xor]++
	}
	xor = 0
	for _, num := range nums2 {
		xor ^= num
		g[xor]++
	}

	f = XorConvolution(f, f)
	f[0] = ((f[0]-(len(nums1)+1))%MOD + MOD) % MOD
	g = XorConvolution(g, g)
	g[0] = ((g[0]-(len(nums2)+1))%MOD + MOD) % MOD

	res := XorConvolution(f, g)
	return res[k] / 4
}

func main() {
	in := bufio.NewReader(os.Stdin)
	out := bufio.NewWriter(os.Stdout)
	defer out.Flush()

	var n, m, k int
	fmt.Fscan(in, &n, &m, &k)
	nums1 := make([]int, n)
	nums2 := make([]int, m)
	for i := 0; i < n; i++ {
		fmt.Fscan(in, &nums1[i])
	}
	for i := 0; i < m; i++ {
		fmt.Fscan(in, &nums2[i])
	}

	fmt.Fprintln(out, xorAndXor(nums1, nums2, k))
}

func XorConvolution(a, b []int) []int {
	a = append(a[:0:0], a...)
	b = append(b[:0:0], b...)
	a = walshHadamardTransform(a, 1)
	b = walshHadamardTransform(b, 1)
	for i := range a {
		a[i] = a[i] * b[i] % MOD
	}
	res := walshHadamardTransform(a, (MOD+1)/2)
	return res
}

func walshHadamardTransform(f []int, op int) []int {
	n := len(f)
	for l, k := 2, 1; l <= n; l, k = l<<1, k<<1 {
		for i := 0; i < n; i += l {
			for j := 0; j < k; j++ {
				f[i+j], f[i+j+k] = (f[i+j]+f[i+j+k])*op%MOD, (f[i+j]+MOD-f[i+j+k])*op%MOD
			}
		}
	}
	return f
}