#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,i,j,a[100005][20],x,y,L,k;
int main ()
{
f>>n>>m;
for(i=1;i<=n;i++) f>>a[i][0];

for(k=1; (1<<k) <=n; k++)
for(i=1;i+(1<<k)-1 <=n;i++)
a[i][k]=min(a[i][k-1],a[i+(1<<(k-1))][k-1]);

while(m--)
{f>>x>>y;
L=log2(y-x);
g<<min(a[x][L],a[y-(1<<L)+1][L])<<'\n';
}

return 0;
}