#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
long long n,m,i,j;
long long rmq[20][100001],lg[1001],diff,l,sh,x,y,k;

int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
    f>>rmq[0][i];
    lg[1]=0;
for(i=2;i<=n;i++)
    lg[i]=lg[i/2]+1;

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

	for (i=1;i<=m;i++)
	{
		f>>x>>y;

    k=y-x+1;
		l=lg[k];
		sh=k-(1<<l)+1;
	g<<min(rmq[l][x],rmq[l][y-(1<<l)+1])<<'\n';
	}
    return 0;
}