#include <fstream>
#include <algorithm>

using namespace std;

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

int N, M;
int start, finish;
int V[100005];
int RMQ[100005][18], logaritm[100005];

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

void rmq()
{
    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[i][j - 1]] <= V[RMQ[i + p][j - 1]])
                RMQ[i][j] = RMQ[i][j - 1];
            else
                RMQ[i][j] = RMQ[i + p][j - 1];
        }
}

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

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

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

        int l = logaritm[finish - start + 1];

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

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