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, …, aj is 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.
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#define ll long long
using namespace std;
const int maxn=2e6+10;
int pos[maxn];
ll cnt[maxn];
ll res=0;
ll ans[maxn];
int a[maxn];
int n,m,k;
struct node
{
int L,R,id;
} q[maxn];
bool cmp(node a,node b)
{
if(pos[a.L]!=pos[b.L]) return pos[a.L]<pos[b.L];
if(pos[a.L]&1) a.R>b.R;
return a.R<b.R;
}
void del(int x)
{
cnt[a[x]]--;
res-=cnt[a[x]^k];
}
void add(int x)
{
res+=cnt[a[x]^k];
cnt[a[x]]++;
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
int block=sqrt(n);
res=0;
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
a[i]^=a[i-1];
pos[i]=(i-1)/block+1;
}
for(int i=1; i<=m; i++)
{
scanf("%d%d",&q[i].L,&q[i].R);
q[i].id=i;
}
sort(q+1,q+1+m,cmp);
int l=0,r=0;
cnt[0]=1;
for(int i=1; i<=m; i++)
{
while(l+1<q[i].L) del(l++);
while(r>q[i].R) del(r--);
while(l+1>q[i].L) add(--l);
while(r<q[i].R) add(++r);
ans[q[i].id]=res;
}
for(int i=1; i<=m; i++)
{
printf("%lld\n",ans[i]);
}
}