#include<stdio.h>
#include<fstream>
using namespace std;
ifstream fi ("rmq.in");
ofstream fo ("rmq.out");
int n,m,x,y,z,i,j,a[100001][18],v[100001],p[100001];
inline int min(int a,int b){
	if(a<b)
		return a;
	else return b;	
}
int main() {
	fi>>n>>m;
	for(i=1;i<=n;++i)
		fi>>v[i];
	
	p[1]=0;
	for(i=2;i<=100000;++i)
		p[i]=1+p[i/2];
	for(i=1;i<=n;++i)
		a[i][0]=v[i];
	x=1;
	
	for(j=1;j<=p[n];++j){
		for(i=1;i+x<=n;++i)
			a[i][j]=min(a[i][j-1],a[i+x][j-1]);

		x*=2;
	}
	
	for(i=1;i<=m;++i){
		fi>>x>>y;
		z=y-x+1;
		int t=1<<p[z];
		fo<<min(a[x][p[z]],a[y-t+1][p[z]])<<'\n';
		
	}
	

	
	
	return 0;
}