#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,j,l[100010],d[20][100010],pow,p,minim,x,y;
int main() {
	fin>>n>>m;
	l[1]=0;
	for (i=2;i<=n;i++)
		l[i]=1+l[i/2];
	for (i=1;i<=n;i++)
		fin>>d[0][i];
	for (i=1;i<=l[n]+1;i++) {
		for (j=1;j<=n;j++) {
			d[i][j]=d[i-1][j];
			if (j+(1<<(i-1))<=n)
				d[i][j]=min(d[i][j],d[i-1][j+(1<<(i-1))]);
		}
	}
	for (i=1;i<=m;i++) {
		fin>>x>>y;
		if (x>y)
			swap(x,y);
		p=l[y-x+1];
		minim=min(d[p][x],d[p][y-(1<<p)+1]);
		fout<<minim<<"\n";
	}
	return 0;
}