#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,lg[100005],a[100005],rmq[100005][18];

void Build()
{ int i,len;
   for(i=2;i<=n;i++)
    lg[i]=lg[i/2]+1;

  for(i=1;i<=n;i++)
   rmq[i][0]=a[i];

  for(len=1;len<=lg[n];len++)
   for(i=1;i<=n-(1<<len)+1;i++)
    rmq[i][len]=min(rmq[i][len-1],rmq[i+(1<<(len-1))][len-1]);
}

int Solve(int x,int y)
{ int len=(y-x+1),p=lg[len];
    return min(rmq[x][p],rmq[y-(1<<p)+1][p]);
}
int main()
{ int i,q,x,y;
    f>>n>>q;
    for(i=1;i<=n;i++)
      f>>a[i];

    Build();


    for(i=1;i<=q;i++)
    { f>>x>>y;
       g<<Solve(x,y)<<"\n";
    }
    return 0;
}