#include <fstream>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
// rmq[i][j] inseamna minimul pe intervalui de
//      lungime 2^i ce incepe cu j
int rmq[20][100005], lg[100005], a[100005];
int n,m,l,dif,sh,rez,x,y;

int main(){
    fin>>n>>m;
    for(int i=1;i<=n;++i) fin>>a[i];
    lg[1]=0; // lg[i] == partea intreaga a lui log2 i
    for(int i=2;i<=n;++i) lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;++i) rmq[0][i]=a[i];
    for(int i=1;(1<<i)<=n;++i)
    for(int 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(int k=1;k<=m;++k){
        fin>>x>>y;
        dif=y-x+1;
        l=lg[dif];
        sh=dif-(1<<l);
        rez=min(rmq[l][x],rmq[l][x+sh]);
        fout<<rez<<'\n';
    }

    return 0;
}