#include <cstdio>
#include<fstream>
using namespace std;
#define NMAX 100002
using namespace std;

long int rmq[20][NMAX];
long int n,m,ul;
long int lg[NMAX];
//long int p2[NMAX];
long int a[NMAX];

inline long int min(long int a, long int b)
{
if(a<b)
	return a;
return b;
}

int main()
{
	//FILE *f,*g;
	//f = fopen("rmq.in","r");
	//g = fopen("rmq.out","w");
	int i;

	//fscanf(f,"%ld %ld",&n,&m);
	
	ifstream fin("rmq.in");
	ofstream fout("rmq.out");
	fin>>n>>m;
	lg[1]=0;
	//fscanf(f,"%ld ",&a[1]);
	fin>>a[1];
	rmq[0][1]=a[1];
	
	for (i=2;i<=n;i++)
	{
		//fscanf(f,"%ld ",&a[i]);
		fin>>a[i];
		rmq[0][i]=a[i];
		lg[i]=lg[i/2]+1;
	}
	/*
	p2[0]=1;
	for(i=1;p2[ul]<=n;i++)
		p2[++ul]=p2[ul-1]<<1;*/

	
	int j,l;
	for (i=1;(1<<i) <=n;i++)
	{
		long int aa = n-(1<<i)+1;
		l=1<<((i-1));
		
		for (j=1;j <= aa;j++)
		{		
		if(rmq[i-1][j] < rmq[i-1][j+l])
			rmq[i][j]= rmq[i-1][j];
		else 
			rmq[i][j]= rmq[i-1][j+l];
		}
	}
	
	long int x,y,diff,sh;
	
	for (i=1;i<=m;i++)
	{
		//fscanf(f,"%ld %ld",&x,&y);
		fin>>x>>y;
		diff=y-x+1;
		l=lg[diff];
		sh=diff - (1<<l);
		//fprintf(g,"%ld\n",min(rmq[l][x],rmq[l][x+sh]) );
		fout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
	}	
	//fclose(f);
	//fclose(g);
	return 0;
}