#include <stdio.h>
#include <math.h>
#include <iostream>
using namespace std;
int k,a,b,v[100001],i,n,q;
int rmq[100001][20];
int j;
int main()
{   freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);


    scanf("%d%d",&n,&q);
    for(i=1;i<=n;i++) scanf("%d",&v[i]);
    for(i=1;i<=n;i++) rmq[i][0]=i;
    for(j=1;(1<<j)<=n;j++)
    for(i=1;i<=n-(1<<j)+1;i++){
        if(v[rmq[i][j-1]]<v[rmq[i+(1<<(j-1))][j-1]]) rmq[i][j]=rmq[i][j-1];
        else rmq[i][j]=rmq[i+(1<<(j-1))][j-1];



    }
for(k=1;k<=q;k++){
    scanf("%d%d",&a,&b);
    int log=(int)(log2(b-a+1));
printf("%d\n",min(v[rmq[a][log]],v[rmq[b-(1<<log)+1][log]]));

}
    return 0;
}