#include<bits/stdc++.h>
using namespace std;
struct tree
{
	int l,r;
	int sum;
	#define l(x) t[x].l
	#define r(x) t[x].r
	#define sum(x) t[x].sum
}t[400005];
int n,m,a[100005];
void build(int p,int l,int r)
{
	l(p)=l,r(p)=r;
	if(l==r)
	{
		sum(p)=a[l];
		return;
	}
	int mid=(l+r)>>1;
	build(p*2,l,mid);
	build(p*2+1,mid+1,r);
	sum(p)=min(sum(p*2),sum(p*2+1));
	return;
}
int ask(int p,int l,int r)
{
	if(l<=l(p)&&r>=r(p))
	{
		return sum(p);
	}
	int mid=(l(p)+r(p))>>1;
	int Min=0x3f;
	if(l<=mid)Min=min(Min,ask(p*2,l,r));
	if(r>mid)Min=min(Min,ask(p*2+1,l,r));
	return Min;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	build(1,1,n);
	while(m--)
	{
		int l,r;
		scanf("%d%d",&l,&r);
		printf("%d ",ask(1,l,r));
	}
	return 0;
}