#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
const int mx=1e9;
int r[17][100010],e[100010];
int n,m,st,dr,minim;
int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++)
         fin >>r[0][i];
    for (int p=1;(1<<p)<=n;p++)
        {for (int i=1;i<=n;i++)
             {r[p][i]=r[p-1][i];
              int j=i+(1<<(p-1));
              if (j<=n && r[p][i]>r[p-1][j]) r[p][i]=r[p-1][j];}}
    e[1]=0;
    for (int i=2;i<=n;i++)
         e[i]=1+e[i/2];
    for (int i=1;i<=m;i++)
        {fin >>st>>dr;
         int q=e[dr-st+1],len=(1<<q);
         fout <<min(r[q][st],r[q][dr-len+1])<<"\n";}
        return 0;
}