#include<stdio.h>
long int minim(long int a,long b)
{
 if(a<b)
  return a;
  return b;
}
long int v[10001][20];
long int lg[100001];
int main()
{
 FILE *fin,*fout;
 fin=fopen("rmq.in","r");
 fout=fopen("rmq.out","w");
 long int x,y,i,m,n,j,k;
 fscanf(fin,"%ld%ld",&n,&m);
 for(i=1;i<=n;i++)
  fscanf(fin,"%ld",&v[0][i]);
  for(i=1;(1<<i)<=n;i++)
   for(j=1;j<=n-(1<<i)+1;j++)
   {
    v[i][j]=minim(v[i-1][j],v[i-1][j+(1<<(i-1))]);
   }
 lg[1]=0;
 for(i=2;i<=n;i++)
  lg[i]=lg[i/2]+1;
 for(i=1;i<=m;i++)
 {
   fscanf(fin,"%ld%ld",&x,&y);
   k=lg[y-x+1];
   fprintf(fout,"%ld\n",minim(v[k][x],v[k][y+1-(1<<k)]));
   
 }
   fclose(fout);
   fclose(fin);
   return 0;
}