#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define MAX 100001
int n,a[MAX],arb[MAX][18];

void make_rmq(){
    int i,j;
    for(i=1;i<=n;i++)arb[i][1]=a[i];
    for(j=2;1<<(j-2)<=n;j++)
    for(i=1;i+(1<<(j-2))-1<=n;i++)
    arb[i][j]=min(arb[i][j-1],arb[i+(1<<(j-2))][j-1]);
}

int main(){
    int i,j,m,k;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    make_rmq();
    for(;m>0;m--){
        scanf("%d %d",&i,&j);
        k=(long double)log10(j-i+1)/(long double)log10(2)+1;
        printf("%d\n",min(arb[i][k],arb[j-k+1][k])); }

//   for(i=1;i<=n;i++){
//    for(j=1;j<=4;j++)printf("%d ",arb[i][j]);
//    printf("\n");}
}