#include <fstream>
#include <cmath>
#define NMAX 100005
#define LOG_MAX 17

using namespace std;

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

int v[NMAX];
int table[NMAX][LOG_MAX];

int main()
{
    int n, m, i, j, x, y, log;
    in >> n >> m;
    for (i = 1; i <= n; ++i)
    {
        in >> v[i];
        table[i][0] = v[i];
    }

    for (log = 1; log < LOG_MAX; ++log)
    {
        for (i = 1; i + (1 << log) - 1 <= n; ++i)
        {
            table[i][log] = min(table[i][log - 1], table[i + (1 << (log - 1))][log - 1]);
        }
    }

    /*for (i = 1; i <= n; ++i)
    {
        for (log = 0; log < LOG_MAX; ++log)
            out << table[i][log] << " ";
        out << '\n';
    }*/

    for (i = 1; i <= m; ++i)
    {
        in >> x >> y;
        if (x > y)
            swap(x, y);
        log = log2(y - x + 1);
        out << min(table[x][log], table[y - (1 << log) + 1][log]) << '\n';
    }
    return 0;
}