#include<stdio.h>
int min(int a ,int b)
{

    if(a>b)
        return b;
    return a;
}
int v[100004],d[100004][18],i,j,n,lg[100004],m,p,x,y,k;
int main()
{

    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=0;i<n;i++)
        scanf("%d",&v[i]);
    p=1;
    int nr=0;
    for(i=2;i<=n;i++)
    {
        lg[i]=lg[i/2]+1;
    }
    for(i=0;i<n;i++)
        d[i][0]=i;
    for(j=1;(1<<j)<=n;j++){
        for(i=0;i+(1<<j)-1<n;i++)
        {
            if(v[d[i][j-1]]>v[d[i+(1<<(j-1))][j-1]])
                d[i][j]=d[i+(1<<(j-1))][j-1];
            else
                d[i][j]=d[i][j-1];

          //  printf("%d ",d[i][j]);

        }
      //  printf("\n");
    }

    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        x--;
        y--;
        k=lg[y-x+1];
        printf("%d \n",min(v[d[x][k]],v[d[y-(1<<k)+1][k]]));
    }
    return 0;


}