#include <fstream>
#include <cstring>
#include <deque>

using namespace std;

static const int MAXN = 100009;
static const int INF = 0x3F3F3F3F;
static const int LG = 18;
int n, m;
int v[MAXN][LG];
int lg[MAXN];

int main()
{
	int x, y;
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f >> n >> m;
	lg[0] = -1;
	for(int i = 1; i <= n; i++)
	{
		f >> v[i][0];
		lg[i] = lg[i / 2] + 1;
	}
	for(int i = 1; i < LG; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			v[j][i] = min(v[j][i - 1], v[min(n, (j + (1 << (i - 1))))][i - 1]);
		}
	}
	for(int i = 0; i < m; i++)
	{
		f >> x >> y;
		
		int lgdif = lg[y - x + 1];
		int ans = min(v[x][lgdif], v[y - (1 << lgdif) + 1][lgdif]);
		g << ans << '\n';
	}
	f.close();
	g.close();
	return 0;
}