#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using oset = tree<T, null_type, less<T>,
				  rb_tree_tag, tree_order_statistics_node_update>;

#ifdef Wi_TEST
	template<typename T1, typename T2>
	ostream& operator<<(ostream& out, pair<T1,T2> p) {
		out << "(" << p.first << ", " << p.second << ")";
		out.flush();
		return out;
	}
	#define deb(x) cout << #x << " = " << x << endl;
#else
	#define deb(x)
	#define cin fin
	#define cout fout
#endif

const long long MOD = 1e9+7;

#define LM 18
#define N 100005

int dp[LM][N], l2[N];

int main() {
	ios_base::sync_with_stdio(false);
	
	ifstream fin("rmq.in");
	ofstream fout("rmq.out");
	
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= n; ++i) {
		cin >> dp[0][i];
	}
	
	for(int k = 1; (1 << k) <= n; ++k) {
		for(int i = 1; i <= n - (1<<k) + 1; ++i) {
			dp[k][i] = min(dp[k-1][i], dp[k-1][i+(1<<(k-1))]);
		}
	}
	
	for(int i = 2; i <= n; ++i) {
		l2[i] = l2[i-1] + ((i & (i-1)) == 0);
	}
		
	int a, b;
	while(m--) {
		cin >> a >> b;
		int cnt = b-a+1;
		cout << min(dp[l2[cnt]][a], dp[l2[cnt]][b - (1<<l2[cnt]) + 1]) << '\n';
	}
	
	return 0;
}