#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

int main(){
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n, m;
    fin >> n >> m;
    vector < vector < int > > minime;
    for( int i = 0; i <= n; i++ ){
        vector < int > x;
        minime.push_back(x);
        for( int j = 0; j <=n-i+1; j++ ){
            minime[i].push_back(100001);
        }
    }
    for( int i = 1; i <= n; i++ ){
        int numar;
        fin >> numar;
        for( int l = 1; l <= i; l++ ){
            for( int j = 1; j <= n-i+1; j++ ){
                if( minime[l][minime[l].size()-j] > numar ) minime[l][minime[l].size()-j] = numar;
            }
        }
    }
    for( int i = 1; i <= m; i++ ){
        int a, b;
        fin >> a >> b;
        fout << minime[a][b-a+1] << endl;
    }
}