#include<fstream>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int i,j,n,m,v[100000],prmq[100000][17],x,y;
int rmq(int x,int y)
{
    int logy;
    logy=log2(y-x+1);
    if(v[prmq[i][logy]]<v[prmq[y-(1<<logy)+1][logy]])
        return v[prmq[i][logy]];
    return v[prmq[y-(1<<logy)+1][logy]];
}
int main()
{
    f>>n>>m;
    for(i=0;i<n;i++)
      {
         f>>v[i];
         prmq[i][0]=i;
      }
    for(j=1;1<<j<=n;j++)
      for(i=0;i+(1<<j)-1<n;i++)
        if(v[prmq[i][j-1]]<v[prmq[i+(1<<(j-1))][j-1]])
            prmq[i][j]=prmq[i][j-1];
        else
            prmq[i][j]=prmq[i+(1<<(j-1))][j-1];
  /* for(i=0;i<n;i++)
   {
       for(j=0;j<=log2(n);j++)
         g<<v[prmq[i][j]]<<" ";
       g<<'\n';
   } */
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        g<<rmq(x-1,y-1)<<'\n';
    }
 f.close();g.close();
 return 0;
}