#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n,m,i,c,j,p,P,L[100010],V[17][100010],d,x,y,lo,hi,mi;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        scanf("%d",&V[0][i]);
    for(i=1;;i++)
    {
        hi=1<<i;
        if(hi>n)break;
        mi=hi/2+1;
        lo=1;
        for(;hi<=n;lo++,mi++,hi++)
            V[i][lo]=min(V[i-1][lo],V[i-1][mi]);
    }
    for(;m;m--)
    {
        scanf("%d%d",&x,&y);
        d=y-x+1;
        for(p=1,i=0;;p*=2,i++)
            if(2*p>d)break;
        printf("%d\n",min(V[i][x],V[i][y-p+1]));
    }
    return 0;
}