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 = 1<<20;
    static final long S = 1L<<12;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();
        long seed = sc.nextLong();
        for (int i = 0; i < 10000; i++) {
            seed = seed ^ (seed << 13);
            seed = seed ^ (seed >>> 7);
            seed = seed ^ (seed << 17);
        }
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            seed = seed ^ (seed << 13);
            seed = seed ^ (seed >>> 7);
            seed = seed ^ (seed << 17);
            a[i] = (int)(seed >>> 33);
        }
        Arrays.sort(a);

        int[] idx = new int[(int)(B+1)];
        int c = 0;
        for (int i = 0; i <= B; i++) {
            idx[i] = c;
            while (c < n && (int)(a[c] >>> 12) == i) c++;
        }
        
        long sm = 0;
        for (int qc = 0; qc < q; qc++) {
            seed = seed ^ (seed << 13);
            seed = seed ^ (seed >>> 7);
            seed = seed ^ (seed << 17);
            int x = (int)(seed >>> 33);

            int i = (x >>> 12);
            int l = idx[i]-1, r = idx[i+1];
            while (r-l > 1) {
                int md = (l+r)>>>1;
                if (a[md] < x) {
                    l = md;
                } else {
                    r = md;
                }
            }

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