#include <stdio.h>

using namespace std;

const int N=100001;
const int LOG=17;

int r[N][LOG];
int v[N],p2[N];

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

int main()
{
    FILE *in,*out;
    in=fopen("rmq.in","r");
    out=fopen("rmq.out","w");
    int i,j,n,m,x,y,minim,p;

    fscanf(in,"%d%d",&n,&m);

    for(i=1;i<=n;i++)
        fscanf(in,"%d",&v[i]);

    for(i=1;i<=n;i++)
    {
        r[i][0]=v[i];
        for(j=1;(1<<(j-1))<i;j++)
        {
            r[i][j]=min(r[i-(1<<(j-1))][j-1], r[i][j-1]);
        }
    }

    p2[1]=0;
    for(i=2;i<=n;i++)
    {
        p2[i]=p2[i-1];
        if((1<<(p2[i]+1))==i) p2[i]++;
    }

    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d",&x,&y);
        p=p2[y-x+1];
        minim=min(r[x+(1<<p)-1][p],r[y][p]);
        fprintf(out,"%d\n",minim);
    }

    return 0;
}