#include <fstream>
#include <algorithm>
#include <cmath>

using namespace std;

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

int N, M;
int logaritm[100001];
int V[100001], RMQ[17][100001];

void init_logaritm()
{
    logaritm[1] = 0;
    for (int i = 2; i <= N; ++i)
        logaritm[i] = logaritm[i >> 1] + 1;
}

void rmq()
{
    for (int i = 1; i <= N; ++i)
        RMQ[0][i] = i;

    for (int j = 1; (1 << j) <= N; ++j)
        for (int i = 1; i + (1 << (j - 1)) <= N; ++i)
        {
            int p = 1 << (j - 1);

            if (V[RMQ[j - 1][i]] <= V[RMQ[j - 1][i + p]]) RMQ[j][i] = RMQ[j - 1][i];
            else                                          RMQ[j][i] = RMQ[j - 1][i + p];
        }
}

int main()
{
    fin >> N >> M;
    for (int i = 1; i <= N; ++i)
        fin >> V[i];
    init_logaritm();

    rmq();

    for (int i = 1, start, finish; i <= M; ++i)
    {
        fin >> start >> finish;
        int l = logaritm[finish - start + 1];

        fout << min(V[RMQ[l][start]], V[RMQ[l][finish - (1 << l) + 1]]) << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}