#include <iostream>
#include <fstream>
#include <algorithm>

///#include <tryhardmode>
///#include <GODMODE::ON>
///practice

using namespace std;

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

const int NMAX=1e5+5;
long long rmq[18][NMAX];
long long lg[NMAX];
long long v[NMAX];

int main()
{
    int n,m,i,j,l,x,y,val,calc;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>v[i];
    lg[1]=0;
    for(i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(i=1;i<=n;i++)
        rmq[0][i]=v[i];
    for(i=1;(1<<i)<=n;i++)
        for(j=1;j<=n-(1<<i)+1;j++)
        {
            l=(1<<(i-1));
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        calc=y-x+1;
        l=lg[calc];
        val=calc-(1<<l);
        fout<<min(rmq[l][x],rmq[l][x+val])<<"\n";
    }
    return 0;
}