#include <fstream>
#define nmax 100005
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,M,i,j,m[nmax][20],v[nmax],x,y,l;
int main()
{
    f>>n>>M;
    for(i=1;i<=n;i++)
        f>>v[i];
    for(i=1;i<=n;i++)m[i][0]=i;
    for(j=1;(1<<j)<=n;j++)
        for(i=1;i<=n-(1<<j)+1;i++)
        if(v[m[i][j-1]]<=v[m[i+(1<<(j-1))][j-1]]) m[i][j]=m[i][j-1];
        else m[i][j]=m[i+(1<<(j-1))][j-1];
    for(i=1;i<=M;i++)
    {
        f>>x>>y;
        l=(int)log2(y-x+1);
        g<<min(v[m[x][l]],v[m[y-(1<<l)+1][l]])<<'\n';
    }
    return 0;
}