#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;

const string file = "rmq";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)

int N, M;
vi pw;
vvi rmq;

int main() {
#ifndef INFOARENA
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif
	int i, j, lg, a, b, diff, shift, line;
	scanf("%d %d", &N, &M);
	pw.resize(N + 1);
	pw[1] = 0;
	for (i = 2; i <= N; ++i) {
		pw[i] = pw[i / 2] + 1;
	}

	rmq.resize(pw[N] + 1);
	rmq[0].resize(N + 1);
	for (int i = 1; i <= N; ++i) {
		scanf("%d", &rmq[0][i]);
	}
	
	for (i = 1; (1 << i) <= N; ++i) {
		rmq[i].resize(N - (1 << i) + 2);
		for (j = 1; j <= N - (1 << i) + 1; ++j) {
			lg = 1 << (i - 1);
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + lg]);
		}	
	}
	

	
	
	for (i = 0; i < M; ++i) {
		scanf("%d %d", &a, &b);
		diff = b - a + 1;
		line = pw[diff];
		shift = diff - (1 << line);
		printf("%d\n", min(rmq[line][a], rmq[line][a + shift]));
	}
	
	return 0;
}