#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a,b,l,P[100005],D[20][100005];
int main()
{
    int i,j;
    fin>>n>>m>>D[0][1];
    for (i=2;i<=n;++i)
    {
        fin>>D[0][i];
        P[i]=1+P[i>>1];
    }
    for (i=1;i<=P[n];++i)
        for (j=1;j<=n;++j)
        {
            D[i][j]=D[i-1][j];
            if (j+(1<<(i-1))<=n && D[i-1][j+(1<<(i-1))]<D[i][j])
                D[i][j]=D[i-1][j+(1<<(i-1))];
        }
    for (i=1;i<=m;++i)
    {
        fin>>a>>b;
        l=P[b-a+1];
        fout<<min(D[l][a],D[l][1+b-(1<<l)])<<"\n";
    }
    return 0;
}