#include <iostream>
#include <fstream>
#include <cmath>
#define nmax 100001
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,q,i,m[nmax][21],x,y,l,v[nmax],j;
int main()
{ int i,j,l,x,y;
    f>>n>>q;
    for(i=1;i<=n;i++)
    {
        m[i][0]=i;
        f>>v[i];

    }
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i+(1<<j)-1<=n;i++)
         {
            if(v[m[i][j-1]]>v[m[i+(1<<(j-1))][j-1]]) m[i][j]=m[i+(1<<(j-1))][j-1];
            else m[i][j]=m[i][j-1];
         }

    for(i=1;i<=q;i++)
    {
        f>>x>>y;
        l=log2(y-x+1);
        g<<min(v[m[x][l]],v[m[y-(1<<l)+1][l]])<<'\n';
    }
    return 0;
}