#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream o("rmq.out");
int a[100][1001000],n,m;


int main(){
	int x,y;
	f>>n>>m;
	for(int i=0;i<n;i++)f>>a[0][i];
	for(int i=1;(1<<i)<=n;i++)
	 for(int j=0;j+(1<<i)-1<n;j++)
	   a[i][j] = min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
	for(int i=0;i<n;i++){
	//	for(int j=0;j<n;j++)o<<a[i][j]<<" ";o<<endl;
	}
	int log1;
	for(int i=1;i<=m;i++){
		f>>x>>y;
		x--;
		y--;		
		for(log1=0;(1<<log1)<=(y-x+1);log1++);
		log1--;
	//	o<<log1<<endl;
		
		o<<min(a[log1][x],a[log1][y-(1<<(log1-1))])<<"\n";
	}
}