#include<cstdio>
#define min(a,b) (a<b)?a:b
#define max(a,b) (a>b)?a:b
using namespace std;
int n,m,i,x,y,j;
int minn,nr;
int arbint[1000005];
void update(int nod,int left,int right,int poz,int val)
{
	 if (left==right)
     {
		arbint[nod]=val;
        return;
     }
     int mij=(left+right)/2;
     if (poz<=mij){ update(2*nod,   left,   mij,  poz, val);}
     else           update(2*nod+1, mij+1, right, poz, val);
	 arbint[nod]=min(arbint[2*nod],arbint[2*nod+1]);
}

void query(int nod,int left,int right,int a,int b)
{
	if (a<=left&& right<=b)
     {
		if (minn>arbint[nod]) minn=arbint[nod];
        return;
     }
     int mij=(left+right)/2;
     if (a<=mij) query(2*nod,   left,   mij,  a, b);
     if (mij<b)  query(2*nod+1, mij+1, right, a, b);
}

int main()
{
	freopen ("rmq.in","r",stdin);freopen ("rmq.out","w",stdout);
	scanf("%d %d",&n,&m);
	for(i=1;i<=n;i++)
	{
	  scanf("%d",&nr);
	  update(1,1,n,i,nr);
	}
	for(i=1;i<=m;i++)
	{
		minn=200000000;
		scanf("%d %d",&x,&y);
		query(1,1,n,x,y);
		printf("%d\n",minn);
	}
	
return 0;}