#include <fstream>
using namespace std;

int n, m;
int a[100001], minim[100001][16];

void precalc(void) {
	for(int i = 0; i < n; ++i)
		minim[i][0] = i;
	for(int j = 1; (1 << j) <= n; ++j)
		for(int i = 0; i + (1 << j) - 1 < n; ++i) {
			if(a[minim[i][j-1]] <= a[minim[i + (1 << (j-1))][j-1]])
				minim[i][j] = minim[i][j-1];
			else
				minim[i][j] = minim[i + (1 << (j-1))][j-1];
		}
}

inline int rmq(int x, int y) {
	int pow = 0;
	int dif = y - x + 1;
	while(dif != 1) {
		++pow;
		dif >>= 1;
	}
	if(a[minim[x][pow]] <= a[minim[y - (1 << pow) + 1][pow]])
		return minim[x][pow];
	else 
		return minim[y - (1 << pow) + 1][pow];
}

int main(void) {
	ifstream fin("rmq.in");
	fin >> n >> m;
	for(int i = 0; i < n; ++i)
		fin >> a [i];
		
	precalc();
	ofstream fout("rmq.out");
	for(int i = 0; i < m; ++i) {
		int x, y;
		fin >> x >> y;
		fout << a[rmq(x-1, y-1)] << '\n';
	}
	fin.close();
	fout.close();
}