#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const int N=1e5+7;
ll f[N][64],lg[N];
int main()
{
	ll m,n;
	cin>>m>>n;
	lg[1]=0;
	for (ll i=1;i<=m;i++){
		cin>>f[i][0];
		if (i>=2){
			lg[i]=lg[i>>1]+1;
		}
	}
	for (ll i=1;i<=lg[m];i++){
		for (ll j=1;j<=m-(1<<i)+1;j++){
			f[j][i]=min(f[j][i-1],f[j+(1<<(i-1))][i-1]);
		}
	}
	while (n--){
		ll l,r;
		cin>>l>>r;
		ll lg2=floor(lg[r-l+1]);
		cout<<min(f[l][lg2],f[r-(1<<lg2)+1][lg2])<<endl;
	}
    return 0;
}

0分求调