#include <stdio.h>
#include <vector>

using namespace std;

#define NMAX 100002
#define LMAX 18

long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];

int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);

	long int i,j,l;

	scanf("%ld %ld",&n,&m);

	for (i=1;i<=n;i++)
		scanf("%ld ",&a[i]);

	lg[1]=0;
	for (i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;

	for (i=1;i<=n;i++)
		rmq[0][i]=a[i];

	for (i=1; (1 << i) <=n;i++)
		for (j=1;j <= n - (1 << i)+1;j++)
		{
		l=1<<(i-1);
		rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
		}

	long int x,y,diff,sh;
	
	for (i=1;i<=m;i++)
	{
		scanf("%ld %ld",&x,&y);
		
		diff=y-x+1;
		l=lg[diff];
		sh=diff - (1<<l);
		printf("%ld\n",min(rmq[l][x],rmq[l][x+sh]) );
	}	
	return 0;
}


/*#include<cstdio>
#include<fstream>
using namespace std;
int nr[18][100100],log[100100];
inline int min(int a,int b){
	return a<b?a:b;
}
int main(){
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	int n,m,i,j,x,y;
	f>>n>>m;
	f>>nr[0][1];
	for(i=2;i<=n;++i){
		f>>nr[0][i];
		log[i]=log[i>>1]+1;
	}
	for(j=1;(1<<j)<=n+1;++j){
		for(i=1;i+(1<<j)<=n+1;++i){
			nr[j][i]=min(nr[j-1][i],nr[j-1][i+(1<<(j-1))]);
		}
	}
	for(i=0;i<m;++i){
		f>>x>>y;
		++y;
		j=log[y-x];
		g<<min(nr[j][x],nr[j][y-(1<<j)])<<'\n';
	}
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}
*/