//Include
#include <cstdio>
#include <algorithm>
using namespace std;

//Definitii
#define leftSon (node<<1)
#define rightSon (node<<1)+1

//Constante
const int TREE_SIZE = (int)4e5+1;
const int oo = (1<<30) - 1;

//Functii
void update(int node, int left, int right);
void query(int node, int left, int right);

//Variabile
int elements, questions;
int position, value;
int leftRange, rightRange;
int minValue;
int tree[TREE_SIZE];

//Main
int main()
{
	freopen("rmq.in", "rt", stdin);
	freopen("rmq.out", "wt", stdout);
	
	scanf("%d%d", &elements, &questions);
	for(position=1 ; position<=elements ; ++position)
	{
		scanf("%d", &value);
		update(1, 1, elements);
	}
	
	while(questions--)
	{
		minValue = oo;
		scanf("%d%d", &leftRange, &rightRange);
		query(1, 1, elements);
		printf("%d ", minValue);
	}
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}

void update(int node, int left, int right)
{
	if(left == right)
	{
		tree[node] = value;
		return ;
	}
	
	int mid = (left+right)>>1;
	
	if(position <= mid)
		update(leftSon, left, mid);
	else
		update(rightSon, mid+1, right);
	
	tree[node] = min(tree[leftSon], tree[rightSon]);
}

void query(int node, int left, int right)
{
	if(leftRange <= left && right <= rightRange)
	{
		minValue = min(minValue, tree[node]);
		return ;
	}
	
	int mid = (left+right)>>1;
	if(leftRange <= mid)
		query(leftSon, left, mid);
	if(mid < rightRange)
		query(rightSon, mid+1, right);
}