#include <fstream>
#include <vector>
#include <algorithm>

class RMQ {
public:
	RMQ(const std::vector<int>& _v) : v(_v), log(v.size()), mins(20, std::vector<int>(v.size())) {
		build();
	}

	int min(int a, int b) {
		if (a > b)
			std::swap(a, b);
		int delta = b - a + 1;
		return std::min(mins[log[delta]][a], mins[log[delta]][b - (1 << log[delta]) + 1]);
	}

private:
	const std::vector<int>& v;
	std::vector<int> log;
	std::vector<std::vector<int>> mins;
	void build() {
		int n = v.size();
		for (int i = 2; i < n; i++)
			log[i] = log[i / 2] + 1;
		for (int i = 0; i < n; i++) 
			mins[0][i] = v[i];
		for (int j = 1; (1 << j) <= n; j++)
			for (int i = 0; i + (1 << j) - 1 < n; i++)
				mins[j][i] = std::min(mins[j - 1][i], mins[j - 1][i + (1 << (j - 1))]);
	}
};

int main() {
	std::ifstream in("rmq.in");
	std::ofstream out("rmq.out");

	int n, m;
	in >> n >> m;

	std::vector<int> v(n);
	for (int i = 0; i < n; i++) {
		int x;
		in >> x;
		v[i] = x;
	}

	RMQ q(v);
	for (int i = 0; i < m; i++) {
		int u, v;
		in >> u >> v;
		out << q.min(u - 1, v - 1) << "\n";
	}

	return 0;
}