#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define maxn 2000005
ll a[maxn];
ll st[maxn][22];
int n,k,q;


int main(){
	
	
	freopen("coin.in","r",stdin);
	freopen("coin.out","w",stdout);
	
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n>>q>>k;
	
	
	for(int i=1;i<=n;i++){
		cin>>a[i];
	} 
	
	for(int i=1;i<=n;i++){
		st[i][0]=a[i];
	}
	
	for(int j=1;j<=20;j++){
		for(int i=1;i+(1<<j)-1<=n;i++){
			st[i][j]=max(st[i][j-1],st[i+(1<<(j-1))][j-1]);
		}
	}
	
	
	while(q--){
		int a,b;
		cin>>a>>b;
		int len=log2(b-a+1);
		ll p=max(st[a][len],st[b-(1<<len)+1][len]);
		cout<<p+(b-a+1)<<"\n";
	}
	
	
	
	
	
	return 0;
}