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

#include <iostream>
#include <fstream>

using namespace std;

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

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

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