#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long long n,m,log,x,y;
long long a[20][100001],puteri[1000001];

int main(){
	fin>>n>>m;
	for(int i=1;i<=n;i++)
		fin>>a[0][i];

	for(int i=1;(1<<i)<=n;i++){
		for(int j=1;j<=n;j++){
			a[i][j]=a[i-1][j];
			if(j + (1<<(i-1))<=n){
				if(a[i-1][j+( 1<<(i-1) )]< a[i][j])

					a[i][j]=a[i-1][j+( 1<<(i-1) )];
			}
		}
	}
	for(int i=2;i<=n;i++){
		puteri[i]=1+puteri[i/2];
	}
	for(int i=1;i<=m;i++){
		fin>>x>>y;
		log=puteri[y-x+1];
        if(a[log][x]<a[log][y-( 1<<log )+1]){
            fout<<a[log][x]<<"\n";
        }
        else{
            fout<<a[log][y-( 1<<log )+1]<<"\n";
        }
	}
	return 0;
}