#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 200005
#define M 1100000
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,K,a[N],ans,x,y,z,lg[M];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("coin.in","r",stdin);freopen("coin.out","w",stdout);;
	lg[1]=1;fo(i,2,M-1)lg[i]=lg[i>>1]<<1;
	n=read();m=read();K=read();
	fo(i,1,n)a[i]=read();
	sort(a+1,a+n+1);
	while(m--)
	{
		x=read()^ans;y=read()^ans;
		if(a[1]==a[n])ans=min(lg[a[1]]+(y-x+1)*2,a[1]+(y-x+1));
		else
		{
			ans=a[n]+n;
			for(int k=lg[a[n]],i=1;k<a[n];k++)
			{
				while(i<=n&&a[i]<=k)i++;
				ans=min(ans,k+n+(n-i+1));
			}
		}
		printf("%lld\n",ans);
		if(K==1)ans=0;
	}
	return 0;
}