#include <iostream>
#include <fstream>

using namespace std;

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

int rmq[21][100001], ep[100001];

int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> rmq[0][i];
    for (int p = 1; (1<<p) <= n; p++) // 2^p <= n
        for (int i = 1; i <= n; i++) {
            rmq[p][i] = rmq[p - 1][i];
            int j = i + (1 << (p - 1)); // i + 2^(p - 1)
            if (j <= n && rmq[p][i] > rmq[p - 1][j]) // verificam margini si min()
                rmq[p][i] = rmq[p - 1][j];
        }
    ep[1] = 0;
    for (int i = 2; i <= n; i++)
        ep[i] = 1 + ep[i / 2];
    for (int i = 1; i <= m; i++) {
        int st, dr;
        fin >> st >> dr;
        int e = ep[dr - st + 1];
        int len = (1 << e);
        fout << min(rmq[e][st], rmq[e][dr - len + 1]) << "\n";
    }
    return 0;
}