#include <fstream>
#include <math.h>
#include <algorithm>

using namespace std;

ifstream f ("rmq.in");
ofstream g("rmq.out");

int n,m,i,j,x,y,c,a[20][100005];

int main ()
{
	f >> n >> m;
	for (i = 1; i <= n; i++)
		f >> a[0][i];
	for (i = n; i > 0; i--)
		for (j = 1; (1<<j) <= n; j++)
			a[j][i] = min(a[j - 1][i], a[j - 1][i + (1<<(j - 1))]);
    for (i = 1; i <= m; i++)
    {
        f >> x >> y;
        c = (int)log2(y - x + 1);
        g << min(a[c][x], a[c][y - (1<<c) + 1]) << "\n";
    }
	return 0;
	f.close();
	g.close();
}