#include<stdio.h>
#include<algorithm>
using namespace std;
int a[100005];
int d[100005][20];
int msb[100005];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m,i,j,x,y,L;
    scanf("%d%d",&n,&m);
    msb[1]=0;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        d[i][0]=a[i];
        if(i>=2)
            msb[i]=msb[i>>1]+1;
    }
    for(i=1;(1<<i)<=n;i++)
        for(j=1;j<=n-(1<<i)+1;j++)
            d[j][i]=min(d[j][i-1],d[j+(1<<(i-1))][i-1]);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        L=msb[y-x+1];
        printf("%d\n",min(d[x][L],d[y+1-(1<<L)][L]) );
    }
    return 0;
}