#include<iostream>
#include<fstream>
#include<vector>
#include<cstring>
#include<sstream>
#include<map>
#include<algorithm>
#include<set>
#include<deque>
#include<queue>
using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

const int mx=1e5+200;

int n,m,v[mx],dp[19][mx],lg[mx];
string input;
int cursor=0;

int read_int(){
	int result=0;

	while(input[cursor]>='0' && input[cursor]<='9'){
		result=result*10+(input[cursor]-'0');
		cursor++;
	}		
	cursor++;
	return result;
}


void read(){
	std::stringstream buffer;
	buffer<<in.rdbuf();
	input=buffer.str();

	n=read_int();
	m=read_int();

	for(int i=0;i<n;i++){
		v[i]=read_int();
	}
}

void preprocess(){
	lg[1]=0;
	for(int i=2;i<mx;i++){
		lg[i]=lg[i/2]+1;
	}
	
	for(int i=0;i<n;i++){
		dp[0][i]=v[i];
	}

	for(int i=1;(1<<i)<=n;i++){

		int last=1<<(i-1),here=1<<i;

		for(int k=0;k<=n-here;k++){
			dp[i][k]=min(dp[i-1][k],dp[i-1][k+last]);
		}

	}
}

int query(int l,int r){
	int dist=r-l+1,chunk=lg[dist];
	int length=(1<<chunk);

	return min(dp[chunk][l],dp[chunk][r-length+1]);
}

void solve(){
	preprocess();
	int l,r;
	for(int i=0;i<m;i++){
		l=read_int();
		r=read_int();
		out<<query(l-1,r-1)<<'\n';
	}
}

int main(){
	read();
	solve();

	return 0;
}