#include <iostream>
#include <fstream>

using namespace std;

const int MAX_N = 100005;

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

int rmq[20][MAX_N];

int query (int pos1, int pos2) {
    
    int p;
    for ( p = 0; (1 << p) <= pos2 - pos1 + 1; p++ );
    
    p--;
    
    return min ( rmq[p][pos1], rmq[p][pos2 - ( 1 << p ) + 1]);
}

int main() {
    
    int pos1, pos2;
    int n, m;
    
    fin >> n >> m;
    
    for ( int i = 0; i < n; i++ )
        fin >> rmq[0][i];
    
    for ( int lvl = 1; ( 1 << lvl ) <= n; lvl++ ){
        for ( int i = 0; i <= n - ( 1 << lvl ); i++ )
            rmq[lvl][i] = min ( rmq[lvl - 1][i], rmq[lvl - 1][i + ( 1 << ( lvl - 1 ) )] );
    }
    
    for ( int i = 0; i < m; i++ ) {
        fin >> pos1 >> pos2;
        fout << query(pos1 - 1, pos2 - 1) << '\n';
    }
}