#include<stdio.h>

int A[20][100010];
int p2[25];

int main(){

  FILE *fin = fopen("rmq.in","r"),
       *fout = fopen("rmq.out","w");
       
  int N,M;
  fscanf(fin,"%d%d",&N,&M);
  
  for(int i=1;i<=N;i++)
    fscanf(fin,"%d",&A[0][i]);
    
  int lim = 0;
  while( (1<<lim) <= N ) lim++;
  lim --;
  
  p2[0] = 1;
  for(int i=1;i<=lim+1;i++) p2[i] = 2*p2[i-1];
  
  for(int j=1;j<=lim;j++)
    for(int i=1;i<=N;i++){
      A[j][i] = A[j-1][i];
      if(i+p2[j-1] <= N && A[j-1][i+p2[j-1]] < A[j][i])
        A[j][i] = A[j-1][i+p2[j-1]];        
    }
  /*  
  for(int i=1;i<=N;i++){
    for(int j=0;j<=lim;j++)
      fprintf(fout,"%d ",A[i][j]);
    fprintf(fout,"\n");
  }
  */  
  for(int i=1;i<=M;i++){
    int li,lf;
    fscanf(fin,"%d%d",&li,&lf);
    
    int k = 0;
    while(p2[k] <= lf-li+1) k++;
    k--;
    
    int sol = 10000000;
    while(k>=0){
       if(p2[k] > lf-li+1)
         k--;
       else{
         if(A[k][li] < sol)
            sol = A[k][li];
         li+=p2[k];
         k--;   
       }
    } 
    
    fprintf(fout,"%d\n",sol);
  }
    
  fclose(fin);
  fclose(fout);
  return 0;
  
}