#include <bits/stdc++.h>
using namespace std ;
ifstream fin("rmq.in") ;
ofstream fout("rmq.out") ;
int rmq[20][100001],n,m,x,y,lg[100001] ;
int main()
{
    fin>>n>>m ;
    for(int i=1; i<=n; ++i) fin>>rmq[0][i] ; ;
    lg[1]=0 ;
    for(int i=2; i<=n; ++i) lg[i]=lg[i>>1]+1 ;
    for(int i=1; i<=lg[n]; ++i)
        for(int j=1; j<=n-(1LL<<(i-1))+1; ++j) rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1LL<<(i-1))]) ;
    while(m--)
    {
        fin>>x>>y ;
        int l=lg[y-x+1] ;
        fout<<min(rmq[l][x],rmq[l][y-(1<<l)+1])<<'\n' ;
    }
    return 0;
}