#include<stdio.h>
#include<algorithm>
#define Nmax 100002
using namespace std;
int n,m;
int rmq[20][Nmax];
int lg[Nmax];

void rezolv()
{
    int i,j,x,y;
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&x);
        rmq[0][i]=x;
    }
    for(j=1;(1<<j)<=n;++j)
        for(i=1;i+(1<<j)-1<=n;++i)
        {
            x=rmq[j-1][i];
            y=rmq[j-1][i+(1<<(j-1))];
            rmq[j][i]=min(x,y);
        }
}

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

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    rezolv();
    scrie();
    fclose(stdin);
    fclose(stdout);
    return 0;
}