#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int main(){
	ifstream cin("algsort.in");
	int n, m;
	cin >> n >> m;

	int log2n = log2(n) + 1;
	vector<vector<int>> RMQ(n, vector<int>(log2n));
	for(int i = 0; i < n; i++) {
		cin >> RMQ[i][0];
	}

	for(int j = 1; j < log2n; j++) {
		for(int i = 0; i < n - (1 << j) + 1; i++) {
			RMQ[i][j] = min(RMQ[i][j - 1], RMQ[i + (1 << j - 1)][j - 1]);
		}
	}

	for(int i = 0; i < m; i++) {
		int x, y; cin >> x >> y;
		x--; y--;
		int l = y - x + 1;
		int p = log2(l);
		cout << min(RMQ[x][p], RMQ[y - (1 << p) + 1][p]) << endl;
	}
}

//#include <algorithm>
//#include <fstream>
//#include <iostream>
//#include <queue>
//#include <set>
//#include <stack>
//using namespace std;
//
//int main() {
//	ifstream cin("algsort.in");
//	int n;
//	cin >> n;
//	vector<vector<int>> intervale(n, vector<int>(3));
//	for (int i = 0; i < n; i++) {
//		cin >> intervale[i][0] >> intervale[i][1];
//		intervale[i][2] = i;
//	}
//	sort(intervale.begin(), intervale.end(), [](const vector<int>& a, const vector<int>& b) {
//		return a[0] < b[0];
//	});
//	vector<int> res(n, -1);
//	priority_queue<int, vector<int>, less<int>> pq;
//
//	int prevEnd = -1;
//	for (int i = 0; i < n; i++) {
//		if(!pq.empty()) {
//			if(pq.top() < intervale[i][0]) {
//
//			}
//		}else {
//			res[intervale[i][2]] = 1;
//		}
//		pq.push(intervale[i][2]);
//	}
//	for(int i = 0; i < n; i++) {
//		cout << res[i] << " ";
//	}
//}
//
//
//// int n, k, A, B, C, D;
//// cin >> n >> k >> A >> B >> C >> D;
//// vector<long long int> a(n);
//// a[0] = A;
//// for (int i = 1; i < n; i++) {
//// 	a[i] = (B * a[i-1] + C) % D;
//// }
//// priority_queue<long long int, vector<long long int>, less<long long int>> pq(begin(a), end(a));
//// stack<long long int> s;
//// while(k > 0) {
//// 	long long int biggestKth = pq.top();
//// 	pq.pop();
//// 	s.push(biggestKth);
//// 	k--;
//// }
////
//// while(!s.empty()) {
//// 	cout << s.top() << " ";
//// 	s.pop();
//// }