#include <fstream>
#include <algorithm>

using namespace std;

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

int rmq[20][100007], Log[100007];

int main()
{
    int n, m, x, y;

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

    for(int i = 2; i <= n; ++i)
        Log[i] = Log[i / 2] + 1;

    for(int l = 1; l <= Log[n]; ++l)
    {
        for(int i = 1; i + (1 << l) - 1 <= n; ++i)
        {
            rmq[l][i] = min(rmq[l - 1][i], rmq[l - 1][i + (1 << (l - 1))]);
        }
    }
    for(int i = 1; i <= m; ++i)
    {
        in >> x >> y;
        int l = Log[y - x + 1];
        int cevap = min(rmq[l][x], rmq[l][y - (1 << l) + 1]);
        out << cevap << "\n";
    }
}