#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,val,poz,start,finish,minimul;
int minArb[500005];
inline int minim (int a, int b)
{
       if(a<b)
               return a;
       return b;
}

void update(int nod, int left, int right)
{
     if(left==right)
     {
      minArb[nod]=val;
      return;
     }
     int div=(left+right)/2;
     if(poz<=div)       update(2*nod,left,div);
     else               update(2*nod+1,div+1,right);
     minArb[nod]=minim(minArb[2*nod],minArb[2*nod+1]);
}

void query(int nod, int left, int right)
{
     if(start<=left && right<=finish)
     {
                    if(minimul>minArb[nod]) minimul=minArb[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);
}

int main()
{
    int i,x,y;
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
     f>>x;
     poz=i, val=x;
     update(1,1,n);
    }
    for(i=1;i<=m;i++)
    {
     f>>x>>y;;
     minimul=100003;
     start=x, finish=y;
     query(1,1,n);
     g<<minimul<<"\n";
   }
   return 0;
}