#include <fstream>

using namespace std;

const int NMAX = 100000;
const int LOGMAX = 17;
const int VALMAX = 100000;

int n;

int rmq[1 + NMAX][LOGMAX];

int putere2Maxima[1 + VALMAX];

void RMQ()
{
    for (int l = 1; (1 << l) <= n; l++)
    {
        for (int i = 1; i <= n - (1 << l) + 1; i++)
        {
            rmq[i][l] = min(rmq[i][l - 1], rmq[i + (1 << (l - 1))][l - 1]);
        }
    }

    int exp = 0;
    int putere2 = 1;

    for (int i = 1; i <= n; i++)
    {
        if (putere2 * 2 <= i)
        {
            putere2 *= 2;
            exp++;
        }

        putere2Maxima[i] = exp;
    }
}

int main()
{
    ifstream in("rmq.in");
    ofstream out("rmq.out");

    int m;

    in >> n >> m;

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

    RMQ();

    for (int j = 1; j <= m; j++)
    {
        int a, b;

        in >> a >> b;

        out << min(rmq[a][putere2Maxima[b - a + 1]], rmq[b - (1 << putere2Maxima[b - a + 1]) + 1][putere2Maxima[b - a + 1]]) << '\n';
    }

    return 0;
}