#include <fstream>

using namespace std;

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

int n, m, x, y, lg[100005], rmq[17][100005];

void RMQ()
{
    for (int i = 2; i <= n; ++i) {
        lg[i] = lg[i >> 1] + 1;
    }

    for (int i = 1; i <= lg[n]; ++i) {
        for (int j = 1; j + (1 << i) - 1 <= n; ++j) {
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
        }
    }
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= n; ++i) {
        f >> rmq[0][i];
    }

    RMQ();

    while (m--) {
        f >> x >> y;

        int mij = lg[y - x + 1];

        g << min (rmq[mij][x], rmq[mij][y - (1 << mij) + 1]) << '\n';
    }

    return 0;
}