using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
        // Test();
    }
    static void Test()
    {
        var r = new Random();
        var n = 200000;
        var m = 200000;
        var k = 1;
        var a = new int[n];
        for (var i = 0; i < n; ++i) a[i] = r.Next(1024);
        var b = new int[m];
        for (var i = 0; i < m; ++i) b[i] = r.Next(1024);
        var start = DateTime.Now;
        WriteLine(Xor(n, m, k, a, b));
        WriteLine((DateTime.Now - start).TotalSeconds);
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var a = NList;
        var b = NList;
        WriteLine(Xor(n, m, k, a, b));
    }
    static long Xor(int n, int m, int k, int[] a, int[] b)
    {
        var adp = new long[1024];
        var ndp = new long[1024];
        var acnt = new long[1024];
        var mod = 1_000_000_007;
        for (var i = 0; i < n; ++i)
        {
            for (var j = 0; j < adp.Length; ++j)
            {
                acnt[j ^ a[i]] += ndp[j ^ a[i]] = adp[j];
            }
            ++ndp[a[i]];
            ++acnt[a[i]];
            (adp, ndp) = (ndp, adp);
        }
        var bdp = new long[1024];
        var bcnt = new long[1024];
        for (var i = 0; i < m; ++i)
        {
            for (var j = 0; j < bdp.Length; ++j)
            {
                bcnt[j ^ b[i]] += ndp[j ^ b[i]] = bdp[j];
            }
            ++ndp[b[i]];
            ++bcnt[b[i]];
            (bdp, ndp) = (ndp, bdp);
        }
        var ans = 0L;
        for (var i = 0; i < acnt.Length; ++i) ans = (ans + acnt[i] % mod * (bcnt[i ^ k] % mod) % mod) % mod;
        return ans;
    }
}