//#include <iostream>
//#include <conio.h>

#include <fstream>
#include <algorithm>
#define DIM 100010

using namespace std;

int n, m;
int v[DIM];
int a[DIM][20];
int lg[DIM];

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

void CreateMatrix()
{
	int base, exp;
	for (int i = 1;i <= n;++i)
	{
		base = 1, exp = 0;
		while (exp <= 20)
		{
			if (i + base > n)
				break;
			int Min = 100001;
			for (int j = i;j <= i + base;++j)
				Min = min(Min, v[j]);
			a[i][exp] = Min;
			++exp;
			base *= 2;
		}
	}
}

int Find(int x, int y)
{
	int dif = y - x, p = 1, i;
	for (i = 0;i <= 17;++i)
	{
		if (dif < p)
			break;
		p *= 2;
	}
	return min(a[x][i - 1], a[y - (1 << (i - 1))][i - 1]);
}

int main()
{
	ifstream f("rmq.in");
	ofstream g("rmq.out");
	f >> n >> m;
	for (int i = 1;i <= n;++i)
		f >> v[i];
	CreateMatrix();
	for (int i = 1;i <= m;++i)
	{
		int x, y;
		f >> x >> y;
		if (x == y)
			g << v[x] << "\n";
		else
		{
			int p = lg[y - x + 1];
			g << min(a[x][p], a[y - (1 << (p))][p]) << "\n";
		}
	}
	//_getch();
	return 0;
}