//
//  main.cpp
//  Range minimum query (infoarena)
//
//  Created by Andrei Bădulescu on 08.04.22.
//

#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

int n, m, b2;
int r[17][100001];
int log[100001];
int rez[100001];

int main() {
    in >> n >> m;
    
    for (int j = 1; j <= n; j++) {
        in >> r[0][j];
    }
    
    b2 = 1;
    
/// Calcularea matricei pentru minime partiale
    
    for (int i = 1; b2 <= n; i++) {
        for (int j = b2; j <= n; j++) {
            int a1 = r[i - 1][j - b2];
            int a2 = r[i - 1][j];
            
            if (a1 > a2) {
                r[i][j] = a2;
            } else {
                r[i][j] = a1;
            }
        }
        
        b2 *= 2;
    }
    
/// Calcularea partea intreaga inferioara a logaritmilor in baza 2
    
    log[1] = 0;
    rez[1] = 0;
    
    for (int i = 2; i <= n; i *= 2) {
        log[i] = log[i / 2] + 1;
        rez[i] = i;
        
        for (int j = i + 1; j < i * 2; j++) {
            log[j] = log[i];
            rez[j] = rez[i];
        }
    }
    
/// Afisare raspunsuri
    
    for (int i = 1; i <= m; i++) {
        int st, dr, l, p;
        in >> st >> dr;
        
        l = log[dr - st + 1];
        p = rez[dr - st + 1];
        
        int a1 = r[l][st + p - 1];
        int a2 = r[l][dr];
        
        if (a1 > a2) {
            out << a2 << '\n';
        } else {
            out << a1 << '\n';
        }
    }
    
    return 0;
}