#include <bits/stdc++.h>
#define NMAX 100009
#define LOGMAX 30
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[NMAX];
int sol[NMAX][LOGMAX];
int n,q;
int i;
int st, dr;
void pre();
int main()
{fin>>n>>q;
 for(i=1;i<=n;i++)
     fin>>v[i];
  pre();
 for(i=1;i<=q;i++)
    {
     fin>>st>>dr;
     int put=1; int exp=0;
     while(put<=dr-st+1)
        {
         put*=2;exp++;
        }
      put/=2;exp--;
      fout<< min(     v[sol[st][exp]]  , v[  sol[  dr+1-put  ][exp]    ]      )  <<'\n';
    }
    return 0;
}
void pre()
{
  int i,j;
  for(i=1;i<=n;i++)
      sol[i][0]=i;
  for(j=1; 1<<j <=n;j++)
        for(i=1;i+ (1<<j)-1    <=n;i++)
            {
               if( v[  sol[i][j-1]  ]  <v[  sol[i+ 1<< (j-1) ][j-1]  ] )
                sol[i][j]=sol[i][j-1];
                 else
                sol[i][j]=sol[i+ 1<< (j-1) ][j-1];

            }
}