#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

int n , m , rmq[100002][20] , a[100002] , x , y;

int main()
{
    fin>>n>>m;
    for(int i = 0 ; i < n ; i++)
        fin>>a[i];
    for(int i = 0 ; i < n ; i++)
        rmq[i][0] = a[i];
    for(int j = 1 ; (1 << j) <= n ; ++j)
        for(int i = 0 ; i + (1 << j) - 1 < n ; ++i){
            if(rmq[i][j-1] <= rmq[i + (1 << (j-1))][j - 1]){
                rmq[i][j] = rmq[i][j - 1];
            }
            else{
                rmq[i][j] = rmq[i + (1 << (j-1))][j - 1];
            }
        }
    /*for(int i = 0 ; i < n ; i++){
        for(int j = 0 ; j <= log2(n) ; j++)
            fout<<rmq[i][j]<<' ';
        fout<<'\n';
    }*/
    for(int i = 1 ; i <= m ; i++){
        fin>>x>>y;
        x--;
        y--;
        int k = log2(y - x + 1);
        if(rmq[x][k] <= rmq[y - (1 << k) + 1][k]){
            fout<<rmq[x][k]<<'\n';
        }
        else{
            fout<<rmq[y - (1 << k) + 1][k]<<'\n';
        }
    }
    return 0;
}