#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n,m,k,l,r,a[N],f[N][21];
int main(){
	cin>>n>>m;
	for (int i=1;i<=n;++i) cin>>a[i],f[i][0]=a[i];
	for (int j=1;j<=20;++j)
		for (int i=1;i+(1<<j)-1<=n;++i)
			f[i][j]=min(f[i][j-1],f[i+(1<<j-1)][j-1]);
	while (m--){
		cin>>l>>r;
		int p=log2(r-l+1);
		cout<<min(f[l][p],f[r-(1<<p)+1][p])<<" ";
	}
}