#include <fstream>
#include <algorithm>

using namespace std;

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

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

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

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

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

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

    preLog();
    rmq();

    int x, y;
    for (int i = 1; i <= M; ++i)
    {
        fin >> x >> y;
        if (x > y)
            swap(x, y);
        int l = logaritm[y - x + 1];

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

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