#include<cstdio>
#include<iostream>
using namespace std;
const int maxn=100010;
struct tree
{
	int l,r;
	int min;
}a[2*maxn];
int c[maxn];
int minn=0x7fffffff;
int built(int k,int l,int r)
{
	a[k].l=l;
	a[k].r=r;
	if(l==r) a[k].min=c[l];
	else
	{
		built(2*k,l,(l+r)/2);
		built(2*k+1,(l+r)/2+1,r);
		a[k].min=min(a[2*k].min,a[2*k+1].min); 
	}
}
int query(int k,int l,int r)
{
	if(l<=a[k].l&&a[k].r<=r) minn=min(minn,a[k].min);
	else
	{
		if(l<=(a[k].l+a[k].r)/2)query(2*k,l,r);
		if(r>(a[k].l+a[k].r)/2)query(2*k+1,l,r);
	}
}
int n,m,x,y;
int main()
{
	freopen("faithful.in","r",stdin);
	freopen("faithful.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&c[i]);
	built(1,1,n);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		minn=0x7fffffff;
		query(1,x,y);
		printf("%d\n",minn);
	}
	return 0;
}