#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double

vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}


int32_t main(){
	startt;
	freopen("rmq.in", "r", stdin);
	freopen("rmq.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	vint a = read(n);
	int log[nax+1];
	log[1] = 0;
	for (int i = 2; i <= nax; i++)
	{
		log[i] = log[i/2] + 1;
	}
	int K = 25;
	int st[n+1][K + 1];
	for (int i = 0; i < n; i++)
	{
		st[i][0] = a[i];
	}
	for (int j = 1; j <= K; j++)
	{
		for (int i = 0; i + (1 << j) <= n; i++)
		{
			st[i][j] = min(st[i][j-1], st[i + (1 << (j - 1))][j - 1]);
		}
	}
	for(int i = 0; i < m; i++)
	{
		int L, R;
		cin >> L >> R;
		L--;
		R--;
		int j = log[R - L + 1];
		int minimum = min(st[L][j], st[R - (1 << j) + 1][j]);
		cout << minimum << endl;
	}
}