import java.util.*; 
public class Main {
    static long seed;
    static int next() {
        seed = seed ^ (seed << 13);
        seed = seed ^ (seed >>> 7);
        seed = seed ^ (seed << 17);
        return (int)(seed >>> 33);
    }

    static final long B = 300000;
    static final long S = (1L<<32) / B + 1;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();
        seed = sc.nextLong();
        for (int i = 0; i < 10000; i++) next();

        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = next();
        Arrays.sort(a);

        long[] idx = new long[(int)B];
        int c = 0;
        for (int i = 0; i < B; i++) {
            idx[i] |= c;
            while (c < n && (int)(a[c] / S) == i) c++;
            idx[i] |= ((long)(c) << 32);
        }
        
        long sm = 0;
        for (int qc = 0; qc < q; qc++) {
            int x = next();

            int i = (int)(x / S);
            int l = (int)(idx[i] & ((1L<<32)-1)) - 1, r = (int)(idx[i] >> 32);
            while (r-l > 1) {
                int md = (l+r)/2;
                if (a[md] < x) {
                    l = md;
                } else {
                    r = md;
                }
            }

            sm ^= (long)(r) * qc;
        }
        System.out.println(sm);
    }
}