#include <iostream>
#include <fstream>
#include <iostream>
using namespace std;

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

int r[17][100010];
int E[100010];
int n, q, e, len;
int st, dr;

int main()
{
    fin >> n >> q;
    for (int i = 1; i <= n; i++)
        fin >> r[0][i];

    for (int p = 1; (1 << p) <= n; p++)
    {
        for (int i = 1; i <= n; i++)
        {
            r[p][i] = r[p - 1][i];
            int j = i + (1 << (p - 1));

            if (j <= n && r[p - 1][j] < r[p][i])
                r[p][i] = r[p - 1][j];
        }
    }

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

    for (int i = 1; i <= q; i++)
    {
        fin >> st >> dr;
        e = E[dr - st + 1];
        len = (1 << e);
        fout << min(r[e][st], r[e][dr - len + 1]) << endl;
    }
    return 0;
}