#include <fstream>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int MaxN = 5 + 100000;
const int MaxV = 5 + 100000;
const int MaxLog = 22;

int RMQ[MaxLog][MaxN];
int Log[MaxV];
int a[MaxN];

int n, m, st, dr;

void doRMQ();

int main()
{
	fin >> n >> m;
	for (int i = 1; i <= n; ++i)
		fin >> a[i];

	doRMQ();
	while (m--)
	{
		fin >> st >> dr;
		if (st > dr) swap(st, dr);

		int k = Log[dr - st + 1];
		if (a[RMQ[k][st]] < a[RMQ[k][dr - (1 << k) + 1]])
			fout << a[RMQ[k][st]] << '\n';
		else fout << a[RMQ[k][dr - (1 << k) + 1]] << '\n';
	}
}

void doRMQ()
{
	Log[1] = 0;
    for (int i = 2; i <= n; ++i)
        Log[i] = Log[i / 2] + 1;

    for (int i = 1; i <= n; ++i)
        RMQ[0][i] = i;

    for (int i = 1; i <= Log[n] + 1; ++i)
        for (int j = 1; j + (1 << (i - 1)) <= n; ++j)
        {
            RMQ[i][j] = RMQ[i - 1][j];
            if (a[RMQ[i][j]] > a[RMQ[i - 1][j + (1 << (i - 1))]])
                RMQ[i][j] = RMQ[i - 1][j + (1 << (i - 1))];
        }
}