#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
FILE*in=fopen("rmq.in","r");
FILE*out=fopen("rmq.out","w");
const int NMAX=100007;
int n,m,i,x,y,j;
int v[NMAX],rmq[19][NMAX],po[]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,131072};
int log(int g)
{
    int lg=0;
    while(g>0)
    {
        g/=2;
        lg++;
    }
    return lg-1;
}
int main()
{
    fscanf(in,"%d%d",&n,&m);
    memset(v,NMAX,sizeof(v));
    for(i=1;i<=n;i++)
    {
        fscanf(in,"%d",&rmq[0][i]);
    }
    i=1;
    while(po[i]<=n)
    {
        for(j=1;j+po[i]-1<=n;j++)
        {
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+po[i-1]]);
        }
        i++;
    }
    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d",&x,&y);
        fprintf(out,"%d\n",min(rmq[log(y-x+1)-1][x],rmq[log(y-x+1)-1][y-po[log(y-x+1)-1]+1]));
    }
}