Background

You created this problem.

Problem Description

You are given a sequence $a$ of $n$ non-negative integers and $q$ queries. For each query, given $l, r$, find:

Here, $\oplus$ denotes the bitwise XOR operation.

Input Format

The first line contains two positive integers $n, q$.

The second line contains $n$ non-negative integers, representing the sequence $a$.

The next $q$ lines each contain two integers $l, r$, representing one query.

Output Format

For each query, output one number per line, representing the answer.

5 5
3 4 6 7 1
3 4
1 2
3 5
4 5
4 4

1
7
7
6
0

8 10
11 14 10 12 3 6 15 11
2 3
3 4
2 7
2 4
3 8
5 6
2 5
8 8
5 8
1 4

4
6
15
6
15
5
15
0
13
7

Hint

For all testdata, it is guaranteed that:

• $1\le n, q\le 3\cdot 10^5$.
• $0\le a_i<2^{30}$.
• $1\le l\le r\le n$.

This problem uses bundled tests, and the special properties of each subtask are as follows:

Translated by ChatGPT 5