#include <iostream>
#include <fstream>
using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

const int N=100001;


int minim(int a, int b)
{
    if(a>b)
        return b;
    else
        return a;
}

int main()
{
    int i,j;
    int v[N], r[N][18], log[N],n,m;
    in>>n>>m;
    for(i=1; i<=n; i++)
    {
        in>>v[i];
    }
    for(i=1; i<=n; i++)
    {
        r[i][0]=v[i];
        for(j=1; (1<<j)<=i; j++)
        {
            r[i][j]=minim(r[i][j-1],r[i-(1<<(j-1))][j-1]);
        }
    }
    log[1]=0;
    for(i=2; i<=n; i++)
    {
        log[i]=1+log[i/2];
    }
    int a,b;
    for(i=1; i<=m; i++)
    {
        in>>a>>b;
        out<<minim(r[b][log[b-a+1]],r[a+(1<<log[b-a+1])-1][log[b-a+1]])<<'\n';
    }
    return 0;
}