#include<fstream>
#include<cmath>
#include<algorithm>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m;
int mat[100009][25];
int input[100009];

//processes mat 
void preprocess() {

	for (int i = 0; i < n; i++) {
		mat[i][0] = i;
	}
	// j = 1 , 2^j <= n
	for (int j = 1; 1 << j <= n; j++) {
		// chunks of i to i + 2^j 
		for (int i = 0; i + (1 << j) <= n; i++) {
			if (input[mat[i][j - 1]] < input[mat[i + (1 << (j - 1))][j - 1]]) {
				mat[i][j] = mat[i][j - 1];
			}
			else {
				mat[i][j] = mat[i + (1 << (j - 1))][j - 1];
			}
		}
	}

}

int rmq(int low, int high) {
	int l = high - low + 1;
	int k = log2(l);
	return min(input[mat[low][k]], input[mat[low + l - (1 << k)][k]]);
}

void solve() {
	fin >> n >> m;
	for (int i = 0; i < n; i++) {
		fin >> input[i];
	}
	preprocess();

	int a, b;
	for (int i = 0; i < m; i++) {
		fin >> a >> b;
		int r = rmq(a - 1, b - 1);
		fout << r << "\n";
	}
}

int main() {
	solve();
}