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

using namespace std;

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

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

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

    for (int j = 1; (1 << j) <= N; ++j)
        for (int i = 1; i + (1 << (j - 1)) <= N; ++i)
        {
            if (V[RMQ[i][j - 1]] <= V[RMQ[i + (1 << (j - 1))][j - 1]]) RMQ[i][j] = RMQ[i][j - 1];
            else                                                       RMQ[i][j] = RMQ[i + (1 << (j - 1))][j - 1];
        }
}

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

    rmq();

    for (int i = 1, start, finish; i <= M; ++i)
    {
        fin >> start >> finish;

        int lg = finish - start + 1;
        int logaritm = log2(lg);

        if (1 & lg) fout << min(V[RMQ[start][logaritm]], V[finish]) << '\n';
        else        fout << V[RMQ[start][logaritm]] << '\n';
    }

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