#include <stdio.h>
#include <algorithm>
#define NMax 100005
#define minim(a,b)((a>b)?b:a)
using namespace std;
int n,m,x,y,arb[4*NMax],pos,val,mini;
void update(int nod,int left,int right)
{
    if(left==right)
    {
        arb[nod] = val;
        return;
    }

    int mij = ((left+right)>>1);
    if( pos<=mij )update((nod<<1),left,mij);
    else update(((nod<<1)|1),mij+1,right);
    arb[nod] = minim(arb[(nod<<1)],arb[((nod<<1))|1]);
}
void query(int nod,int left,int right)
{
    if( x<=left && right<=y )
    {
        if(mini>arb[nod])mini = arb[nod];
        return;
    }

    int mij = ((left+right)>>1);
    if( x<=mij )query((nod<<1),left,mij);
    if( mij<y )query(((nod<<1)|1),mij+1,right);
}
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;++i)
    {
        scanf("%d",&x);
        pos = i;val = x;
        update(1,1,n);
    }
    for(int i=1;i<=m;++i)
    {
        scanf("%d %d",&x,&y);
        mini = (1<<30);
        query(1,1,n);
        printf("%d\n",mini);
    }
    return 0;
}