#include<fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,q,a[22][100100],lg[100100],x,y;
int main(){
	cin >> n >> q;
	for(int i = 1; i <= n; i++)
	{
		if(i >= 2)
			lg[i] = lg[i/2]+1; 
		cin >> a[0][i];
	}
	for(int i = 1; (1<<i) <= n; i++){
		int p = 1<<(i-1),k=n-p*2+1;
		for(int j = 1; j <=k; j++){
			a[i][j] = min(a[i-1][j],a[i-1][j+p]);
		}
	}
	while(q--){
		cin >> x >> y;
		cout << min(a[lg[y-x+1]][x],a[lg[y-x+1]][y-(1<<(lg[y-x+1]))+1]);
	}
}