rt

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lid (id<<1)
#define rid (id<<1)+1

int n,m,a[500005];

struct tree{
	int l,r;
	int mn;
}tr[500005];

void build(int id,int l,int r){
	tr[id].l=l;
	tr[id].r=r;
	if(l==r){
		tr[id].mn=a[l];
		return;
	}
	int mid=(l+r)>>1;
	build(lid,l,mid);
	build(rid,mid+1,r);
	tr[id].mn=min(tr[lid].mn,tr[rid].mn);
}

int minn(int id,int l,int r){
	if(tr[id].l==tr[id].r)
		return tr[id].mn;
	int mid=(tr[id].l+tr[id].r)>>1;
	if(r<=mid) return minn(lid,l,r);
	if(l>mid) return minn(rid,l,r);
	return min(minn(lid,l,mid),minn(rid,mid+1,r));
}

signed main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	build(1,1,n);
	for(int i=1;i<=m;i++){
		int x,y;
		cin>>x>>y;
		printf("%lld ",minn(1,x,y));
	}
	return 0;
}