#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

const int NMAX = 100005;
int rmq[NMAX][25];
int l2[NMAX];
int v[NMAX];
int n, m, st, dr;

inline void precalcLog()
{
	l2[1] = 0;
	for (int i = 2; i <= n; i++)
		l2[i] = l2[(i/2)] + 1;
}

inline void precalcRMQ()
{
	for (int i = 1; i <= n; i++)
		rmq[i][0] = v[i];
	for (int j = 1; (1 << j) <= n; j++)
		for (int i = 1; i + (1 << j) - 1 <= n; i++)
			rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j-1))][j - 1]);
}

inline int query(int st, int dr)
{
	int l = dr - st + 1;
	int lg = l2[l];
	return min(rmq[st][lg], rmq[dr-(1<<lg)+1][lg]);
}

int main()
{
	ifstream cin("rmq.in");
	ofstream cout("rmq.out");
	cin >> n >> m;
	precalcLog();
	for (int i = 1; i <= n; i++)
		cin >> v[i];
	precalcRMQ();
	while (m--)
	{
		cin >> st >> dr;
		cout << query(st, dr) << "\n";
	}
	return 0;
}