#include <bits/stdc++.h>
using namespace std ;
const int NMAX = 100001 ;
ifstream f ("rmq.in") ;
ofstream g ("rmq.out") ;


int query_brutforce ( int x , int y , int v [ NMAX ] )
{
    int i , minim ;
    minim = v [ x ] ;
    for ( i = x + 1 ; i <= y ; ++ i )
    if ( v [ i ] < minim )  minim = v [ i ] ;
    return minim ;
}


int main ()
{
    int n  , q , i , v [ NMAX ]; f >> n >> q ;
    for ( i = 1 ; i <= n ; ++ i )   f >> v [ i ] ;
    while (  q -- )
    {
        int a , b ; f >> a >> b ;
        g << query_brutforce( a , b , v ) << "\n" ;


    }



}