#include<iostream.h>
#include<fstream.h>
#include<stdio.h>
#define N 100001
#define M 1000001
long n,m,a[N],i,j,b[N][18],k,x[M],y[M],l;

void rmq(long b[N][18],long a[N],long n)
{long i,j;
for(i=0;i<n;i++)
      b[i][0]=i;
for(j=1;(1<<j)<=n;j++)
      {for(i=0;i+(1<<j)-1<n;i++)
      if(a[b[i][j-1]]<a[b[i+(1<<(j-1))][j-1]])
             b[i][j]=b[i][j-1];
      else
             b[i][j]=b[i+(1<<(j-1))][j-1];}}

int main()
{ifstream f1("rmq.in");
freopen("rmq.out","w",stdout);
f1>>n>>m;
for(i=0;i<n;i++)
      f1>>a[i];
rmq(b,a,n);
for(j=0;j<m;j++)
      {f1>>x[j]>>y[j];
      x[j]--;
      y[j]--;}
for(l=0;l<m;l++)
      {for(k=1;(1<<k)<=y[l]-x[l]+1;k++);
      k--;
      if(a[b[x[l]][k]]<a[b[y[l]-(1<<k)+1][k]])
            printf("%ld\n",a[b[x[l]][k]]);
      else
            printf("%ld\n",a[b[y[l]-(1<<k)+1][k]]);}
f1.close();
fclose(stdout);
return 0;}