#include <bits/stdc++.h>
using namespace std;
ifstream f ("rmq.in") ;
ofstream g ("rmq.out") ;
int A , B ;
int d[100010][22] , N , M , x;
int main()
{
    f >> N >> M ;
    for (int i = 1 ; i <= N ; ++i)
        f >> d[i][0] ;

    //Precalcul

    for (int j = 1 ; (1<<j) <= N; ++j)
    {

        for (int i = 1 ;  (i + (1<<j)-1) <= N ;  ++i)
        {
            d[i][j] = min(d[i][j-1] , d[i+(1<<(j-1))][j-1]) ;
        }
    }
    for (int i = 1 ; i <= M ; ++i)
    {
        f >> A >> B ;
        x = log2(B-A+1) ;
        g << min(d[A][x] , d[B-(1<<x)+1][x]) << '\n' ;
    }
    return 0 ;
}