#include <stdio.h>
#define maxn 100100
int arb[4*maxn+100],n,m,i,a,b,val,x,start,finish,pos,maxim,v[maxn];
int max(int a,int b) { if(a>=b) return a; return b; }
int min(int a,int b) { if(a>b) return b; return a; }
void update(int nod,int left,int right)
{
    if(left==right)
    {
        arb[nod]=val;
        return;
    }
    int div=(left+right)/2;
    if(pos<=div) update(2*nod,left,div);//stanga
    else update(2*nod+1,div+1,right);//dreapta
    arb[nod]=min(arb[2*nod],arb[2*nod+1]);
}
void query(int nod,int left,int right)
{
    if(start<=left && right<=finish)
    {
        if(maxim>arb[nod]) maxim=arb[nod];
        return ;
    }
    int div=(left+right)/2;
    if(start<=div) query(2*nod,left,div);
    if(div<finish) query(2*nod+1,div+1,right);
}
void build(int nod,int left,int right)
{

   if(left==right){arb[nod]=v[left]; return; }
   build(2*nod,left,(left+right)/2);
   build(2*nod+1,(left+right)/2+1,right);
   arb[nod]=min(arb[2*nod],arb[2*nod+1]);
}
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[i]);
    build(1,1,n);
    for(; m>0; m--)
    {
        scanf("%d%d",&a,&b);
        start=a; finish=b; maxim=maxn;
        query(1,1,n); printf("%d\n",maxim);
    }
    return 0;
}