#include <fstream>
#include <algorithm>

using namespace std;

const int DIM = 100010;
int n, q;
int rmq[DIM][18];
int lg[DIM];

int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin >> n >> q;
    for (int i = 1;i <= n;++i)
        fin >> rmq[i][0];
    lg[1] = 0;
    for (int i = 2;i <= n;++i)
        lg[i] = lg[i >> 1] + 1;
    for (int p = 1;(1 << p) <= n;++p)
        for (int i = 1;i + (1 << p) - 1 <= n;++i)
            rmq[i][p] = min(rmq[i][p - 1], rmq[i + (1 << (p - 1))][p - 1]);
    int a, b, p;
    for (int i = 1;i <= q;++i)
    {
        fin >> a >> b;
        p = lg[b - a + 1];
        fout << min(rmq[a][p], rmq[b - (1 << p) + 1][p]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}