CodeForces - 617E XOR and Favorite Number （莫队）

XOR and Favorite Number

 

Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li and ri and asks you to count the number of pairs of integers i and j, such that l ≤ i ≤ j ≤ r and the xor of the numbers ai, ai + 1, ..., ajis equal to k.

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 ai (0 ≤ ai ≤ 1 000 000) — Bob's array.

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

Output

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

Examples

Input

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

Output

7
0

Input

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

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.

题目链接：http://codeforces.com/problemset/problem/617/E

题目大意：给出长度为n的数列，m个查询，每次查询区间[ l , r ] 内 ai ^ai+1.....^aj 为k 的（i,j）对有多少个

思路：将ai处理为前缀异或和后，ai^aj 就是ai^ai+1....^aj的值，如果加上一个数的话ans+=num[a[x]^k]，减去的话相反。然后就是莫队模板。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
#define ll long long
const int N=3000005;
int a[N],k,num[N];
ll b[N],ans;
struct node
{
    int l,r,pos,id;
}q[N];
bool cmp(node a,node b)
{
    if(a.pos==b.pos)
        return a.r<b.r;
    return a.pos<b.pos;
}
void add(int x,int p)
{
    if(x<0) return;
    ans+=(ll)num[a[x]^k];
    num[a[x]]++;
}
void del(int x,int p)
{
    if(x<0) return;
    num[a[x]]--;
    ans-=(ll)num[a[x]^k];
}
int main()
{
    int n,m;
    scanf("%d%d%d",&n,&m,&k);
    int p=sqrt(n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]),a[i]^=a[i-1];
    int x,y;
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        q[i].id=i,q[i].l=x,q[i].r=y;
        q[i].pos=x/p;
    }
    sort(q,q+m,cmp);
    int l=0,r=0;
    ans=0,num[0]=1;
    for(int i=0;i<m;i++)
    {
        while(l<q[i].l) del(l-1,-1),l++;
        while(l>q[i].l) add(l-2,1),l--;
        while(r>q[i].r) del(r--,-1);
        while(r<q[i].r) add(++r,1);
        b[q[i].id]=ans;
    }
    for(int i=0;i<m;i++)
        printf("%lld\n",b[i]);
    return 0;
}