#include<cstdio>
#include<algorithm>
using namespace std;
const int lmax = 17;
const int nmax = 100005;
int n,m,i,j,rmq[lmax][nmax],p,q,x,y,dif;
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",&rmq[0][i]);
	for(i=1,p=2;p<=n;i++,p<<=1)
        for(j=1;j<=n-p+1;j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+p/2]);
    for(;m;m--)
    {
        scanf("%d%d",&x,&y); dif=y-x+1;
        for(q=0,p=1;p<=dif;q++,p<<=1); p>>=1; q--;
        printf("%d\n",min(rmq[q][x],rmq[q][y-p+1]));
    }
	return 0;
}