XOR and Favorite Number

Description:

Input:

The first line of the input contains integers n, m and k (1 ≤ n, m ≤ 100 000, 0 ≤ k ≤ 1 000 000) — the length of the array, the number of queries and Bob's favorite number respectively.

The second line contains n integers a_i (0 ≤ a_i ≤ 1 000 000) — Bob's array.

Then m lines follow. The i-th line contains integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n) — the parameters of the i-th query.

Output:

Print m lines, answer the queries in the order they appear in the input.

Sample Input:

6 2 3
1 2 1 1 0 3
1 6
3 5

Sample Output:

7
0

Sample Input:

5 3 1
1 1 1 1 1
1 5
2 4
1 3

Sample Output:

9
4
4

Note:

In the first sample the suitable pairs of i and j for the first query are: (1, 2), (1, 4), (1, 5), (2, 3), (3, 6), (5, 6), (6, 6). Not a single of these pairs is suitable for the second query.

In the second sample xor equals 1 for all subarrays of an odd length.