#include<fstream>
#include<algorithm>

#define Nmax 131072
#define Lmax 18

using namespace std;

int A[Nmax][Lmax], lg[Nmax], V[Nmax], N, M;

int main() {

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

    int X, Y, i, j, poz, diff;

    f >> N >> M;
    for(i=1; i<=N; ++i)
        f >> V[i];

    for(i=1; i<=N; ++i)
        A[i][0] = V[i];

    //lg[i] = cea mai mica putere de 2 mai mica decat i
    lg[1] = 0;
    for(i=2; i<=N; i++)
        lg[i] = lg[i / 2] + 1;

    //A[i][j] = minimul din secventa de lungime 2 ^ j care incepe in i
    for(j = 1; (1 << j) <= N; j++)
        for(i = 1; i <= N - (1 << j) + 1; i++)
            A[i][j] = min(A[i][j-1], A[i + (1 << (j-1))][j-1]);

    for(i=1; i<=M; ++i) {
        f >> X >> Y;
        diff = Y - X + 1;
        poz = lg[diff];
        g << min(A[X][poz], A[Y - (1 << poz) + 1][poz]) << "\n";
    }

    f.close();
    g.close();

    return 0;
}