#include <iostream>
#include <fstream>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");

const int NMax = 1e5 + 5;

int N,M;
int v[NMax],lg[NMax],rmq[NMax][20];

int main() {
    in>>N>>M;
    for (int i=1;i<=N;++i) {
        in>>v[i];
        rmq[i][0] = i;
    }

    lg[1] = 0;
    for (int i=2;i<=N;++i) {
        lg[i] = lg[i/2] + 1;
    }

    for (int e=1; (1<<e) <= N; ++e) {
        for (int i=1;i + (1<<e) - 1 <=N;++i) {
            int poz1 = rmq[i][e-1],
                poz2 = rmq[i+(1<<(e-1))][e-1];
            if (v[poz1] < v[poz2]) {
                rmq[i][e] = poz1;
            }
            else {
                rmq[i][e] = poz2;
            }
        }
    }

    while (M--) {
        int a,b;
        in>>a>>b;

        int e = lg[b-a+1];
        int poz1 = rmq[a][e],
            poz2 = rmq[b - (1<<e) + 1][e];
        if (v[poz1] < v[poz2]) {
            out<<v[poz1]<<'\n';
        }
        else {
            out<<v[poz2]<<'\n';
        }
    }
    in.close();out.close();
    return 0;
}