#include <cstdio>
using namespace std;
int n,m,rmq[100010][18],lg[100010],x[100010];

int minim(int a,int b)
{
    if(a<b) return a;
    else return b;
}

int main()
{
    int i,j;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);

    for(i=1;i<=n;i++) scanf("%d",&x[i]);

    lg[1]=0;
    for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;

    for(i=1;i<=n;i++) rmq[i][0]=x[i];

    for(j=1; (1<<j)<=n; j++)
        for(i=1; i+(1<<j)-1<=n; i++)
            rmq[i][j]=minim(rmq[i][j-1],rmq[i+(1<<j-1)][j-1]);

    int st,dr,poz,log;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&st,&dr);
        log=lg[dr-st+1];
        printf("%d\n",minim(rmq[st][log],rmq[dr-(1<<log)+1][log]));
    }

    fclose(stdin);
    fclose(stdout);
    return 0;
}