计蒜客 ACM-ICPC 2017 Asia Xi'an Sum of xor sum （）

网址：https://nanti.jisuanke.com/t/20755

• 
  

•  2000ms
•  262144K

Song Zha Zha has an $1$-indexed array A . Li Zha Zha has $Q$ queries . Each query has two integers $L$, $R$ , asking Ran Zha Zha to do the following thing .First , find all subintervals of $[L,R]$ . Then calculate their xor sum . For example .

$A=1,2,3$ , $L=1$, $R=3$.

All subintervals of $[1,3]$ are $[1,1],[2,2],[3,3],[1,2],[2,3],[1,3]$ .Their xor sum = $1+2+3+1$ xor $2+2$ xor $3+1$xor $2$ xor $3$ .

Xor means exclusive or . (^ in C++ or Java )

Input

The input contains multiple test cases.

First line contains an integer $T$ $(1\le T\le 10)$ , which is the number of test cases .

In each test case:

The first line contains two integers $N$, $Q$. $(1\le N,Q\le 100000)$ . $N$ is the length of the array $A$ .

Then one line contains $N$ integer indicating $A[i]$. $(1\le i\le N,0\le A[i]\le 1000000)$.

Then $Q$ lines follow . Each line two integer $L,R$, means that there’s a query $[L,R]$ . $(1\le L\le R\le N)$.

OutputFor each query, print the answer mod $1000000007$.

样例输入

1
3 1
1 2 3
1 3

样例输出

10

题目来源

ACM-ICPC 2017 Asia Xi'an

• 
  
•  2000ms
•  262144K

•  2000ms
•  262144K