#include <fstream>

using namespace std;

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

const int max_size = 1e5 + 1, rmax = 18;

int rmq[rmax][max_size], lg[max_size];

int main ()
{
    int n, q;
    in >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        in >> rmq[0][i];
        if (i > 1)
        {
            lg[i] = lg[i / 2] + 1;
        }
    }
    for (int e = 1; (1 << e) <= n; e++)
    {
        for (int j = 1; j + (1 << e) - 1 <= n; j++)
        {
            rmq[e][j] = min(rmq[e - 1][j], rmq[e - 1][j + (1 << (e - 1))]);
        }
    }
    while (q--)
    {
        int x, y;
        in >> x >> y;
        int diff = x - y + 1, e = lg[diff];
        out << min(rmq[e][x], rmq[e][y - (1 << e) + 1]) << '\n';
    }
    in.close();
    out.close();
    return 0;
}