#include<fstream>
using namespace std;

#define MAXN 100002
int a[MAXN],x[MAXN][20];
short lg[MAXN];
int main(){
	int n,m,i,j,k;
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f>>n>>m;
	for(i=1;i<=n;i++)
		f>>a[i];
	lg[1]=0;
	for(i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	for(i=1;i<=n;i++)
		x[i][0]=i;
	for(j=1;(1<<j)<=n;j++)
		for(i=1;i<=n-(1<<j)+1;i++)
			if(a[x[i][j-1]]>a[x[i+(1<<(j-1))][j-1]])
				x[i][j]=x[i+(1<<(j-1))][j-1];
			else
				x[i][j]=x[i][j-1];
	for(;m>0;m--){
		f>>i>>j;
		k=lg[j-i+1];
		if(a[x[i][k]]<a[x[j-(1<<k)+1][k]])
			g<<a[x[i][k]]<<'\n';
		else
			g<<a[x[j-(1<<k)+1][k]]<<'\n';
	}
	return 0;
}