#include<stdio.h>

#define input "rmq.in"
#define output "rmq.out"
int a[100001][100001],n,m,log[100001];

inline int min(int x, int y)
{
	return x<y? x:y;
}

void open()
{
	freopen(input,"r",stdin);
	freopen(output,"w",stdout);
}

void read()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[0][i]);
}

void query()
{
	int x,y,t,p,q;
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		p=y-x+1;
		t=log[p];
		q=p-(1<<t);
		printf("%d\n",min(a[t][x], a[t][x+q]));
	}
}

void build()
{
	for(int i=1;(1<<i)<=n;i++)
		for (int j=1;j<=n-(1<<i)+1;j++)
			a[i][j]=min(a[i-1][j], a[i-1][j+(1<<(i-1))]);
	log[1]=0;
	for(int i=2;i<=n;i++)
		log[i]=log[i/2]+1;
}

int main()
{
	open();
	read();
	build();
	query();
	return 0;
}