#include <iostream>
#include <fstream>

using namespace std;

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

int n, m, A[100001], M[21][100001];

void Rmq()
{
    for (int i = 1; i <= n; ++i)
        M[0][i] = A[i];
    for (int e = 1, p = 2; p <= n; ++e, p *= 2)
    {
        for (int i = 1; i <= n - p + 1; ++i)
            M[e][i] = min(M[e - 1][i], M[e - 1][i + p / 2]);
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        fin >> A[i];
    Rmq();
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        int p = 1, e = 0;
        while (p <= y - x + 1)
            p *= 2, ++e;
        p /= 2, --e;
        fout << min(M[e][x], M[e][y - p + 1]) << '\n';
    }

    return 0;
}