#include <fstream>
#define NMAX 100005
#define MAX_LOG 17

using namespace std;

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

int table[NMAX][MAX_LOG];
int log2[NMAX], v[NMAX];

void buildLog()
{
    int i;
    for (i = 2; i <= NMAX; ++i)
        log2[i] = log2[i / 2] + 1;
}

int query(int left, int right)
{
    int len = (right - left + 1);
    int log = log2[len];

    return min(table[left][log], table[right - (1 << log) + 1][log]);
}

int main()
{
    int n, q, i, j, a, b, p;
    in >> n >> q;
    for (i = 0; i < n; ++i)
        in >> v[i];

    buildLog();

    for (i = 0; i < n; ++i)
    {
        table[i][0] = v[i];
    }

    for (p = 1; p <= MAX_LOG; ++p)
    {
        for (i = 0; i + (1 << p) - 1 < n; ++i)
            table[i][p] = min(table[i][p - 1], table[i + (1 << (p - 1))][p - 1]);
    }

    for (i = 1; i <= q; ++i)
    {
        in >> a >> b;
        out << query(a - 1, b - 1) << '\n';
    }
    return 0;
}