#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const char IN[] = {"rmq.in"};
const char OUT[] = {"rmq.out"};
const int INF = 1000000005;
const double PI  = 3.14159265;
const int NMAX = 100005;
const int lgNMAX = 20;

#define II inline
#define LL long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) 	for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) 	for(int i = a ; i >= b ; i--)
#define FORIT(it, V) 	for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
#define all(a) a, a + 

int N, M;
int r[lgNMAX][NMAX];
int lg[NMAX];

void citi()
{
	scanf("%d%d", &N, &M);
	FOR(i, 1, N)
		scanf("%d", &r[0][i]);
}

void init()
{
	for(int pas = 1 ; (1<<pas) <= N ; pas++)
		lg[(1<<pas)] = 1;
	FOR(i, 1, N)
		lg[i] += lg[i - 1];
}

void dinamic()
{
	for(int i = 1 ; (1<<i) <= N ; i++)
		for(int j = 1 ; j + (1<<i) - 1 <= N ; j++)
			r[i][j] = min(r[i - 1][j], r[i - 1][j + (1<<(i - 1))]);
}

void apeluri()
{
	FOR(i, 1, M)
	{
		int x, y, log;
		scanf("%d%d", &x, &y);
		log = lg[y - x + 1];
		printf("%d\n", min(r[log][x], r[log][y - (1<<log) + 1]));
	}
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);
	citi();
	init();
	dinamic();
	apeluri();
	return 0;
}