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

void RMQ(){
    int i,j;
    for(i=0;i<n;i++)c[i][0]=v[i];
    for(j=1;(1<<j)<=n;j++)
    for(i=0;i+(1<<j)<=n;i++)
        c[i][j]=min(c[i][j-1],c[i+(1<<(j-1))][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=0;i<n;i++)scanf("%d",&v[i]);
    RMQ();
    for(;m>0;m--){
        scanf("%d %d",&i,&j);
       k=(int)log10(j-i+1);
        printf("%d\n",min(c[i-1][k],c[j-(1<<k)][k])); }
//printf("%d<=\n",arb[82-7+1][6]);
  // for(i=1;i<=n;i++){
  //  for(j=1;j<=10;j++)printf("%d ",arb[i][j]);
  //  printf("\n");}
}