#include <iostream>
#include <fstream>
#include <cmath>
#define MAX 100001

using namespace std;

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

int N, M;
int lookup[MAX][18];
int v[MAX];

void preprocess(int v[], int n){

    for (int i = 0; i < n; i++)
        lookup[i][0] = i;
 
    for (int j = 1; (1 << j) <= n; j++){
        for (int i = 0; (i + (1 << j) - 1) < n; i++){
            if (v[lookup[i][j - 1]] < v[lookup[i + (1 << (j - 1))][j - 1]])
                lookup[i][j] = lookup[i][j - 1];
            else
                lookup[i][j] = lookup[i + (1 << (j - 1))][j - 1];
        }
    }
}

int rmq(int v[], int st, int dr)
{
    
    int j = (int)log2(dr - st + 1);
 
    if (v[lookup[st][j]]
        <= v[lookup[dr - (1 << j) + 1][j]])
        return v[lookup[st][j]];
 
    else
        return v[lookup[dr - (1 << j) + 1][j]];
}

void read(){

    int st, dr;

    fin >> N >> M;

    for(int i = 0; i < N; i++){
        fin >> v[i];
        
    }
    preprocess(v, N);

    for(int i = 1; i <= M; i++){
        fin >> st >> dr;

        fout << rmq(v, st-1, dr-1) << "\n";
    }


}

int main(){

    read();

    return 0;
}