#include<cstdio>

#include<queue>

#include<cctype>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

using namespace std;

const int N=1e5+;

inline int read(){

    int X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct qu{

    int pos,l,r;

}q[N];

int a[N],ans[N],cnt[N],sum,n,m,k,s;

inline int bel(int x){return (x-)/s+;}

bool cmp(qu b,qu c){

    return bel(b.l)==bel(c.l)?b.r<c.r:b.l<c.l;

}

inline void add(int x){

    sum+=cnt[x^k];

    cnt[x]++;

}

inline void del(int x){

    cnt[x]--;

    sum-=cnt[x^k];

}

int main(){

    n=read(),m=read(),k=read();

    s=sqrt(n);

    for(int i=;i<=n;i++)a[i]=a[i-]^read();

    for(int i=;i<=m;i++){

    q[i].pos=i;q[i].l=read();q[i].r=read();

    }

    sort(q+,q+m+,cmp);

    int ql=,qr=;cnt[]++;

    for(int i=;i<=m;i++){

    while(qr<q[i].r)add(a[++qr]);

    while(qr>q[i].r)del(a[qr--]);

    while(ql<q[i].l)del(a[ql-]),ql++;

    while(ql>q[i].l)ql--,add(a[ql-]);

    ans[q[i].pos]=sum;

    }

    for(int i=;i<=m;i++)printf("%d\n",ans[i]);

    return ;

}