#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,mo[100100],minv[200200],l,r,minn,k;
const int INF=2000000000;
void build(int o,int x,int y)
{
	int lc=o*2,rc=lc+1,m=x+(y-x)/2;//system("qause");
	if(x==y) minv[o]=mo[x];
	else
	{
	    
		build(lc,x,m);
		build(rc,m+1,y);
		minv[o]=min(minv[lc],minv[rc]);
	}
	return;
}
void query(int o,int x,int y)
{
	int lc=o*2,rc=lc+1,m=x+(y-x)/2;
	if(x>=l&&y<=r) minn=min(minv[o],minn);
	else
	{
	    
		if(m>=l) query(lc,x,m);
		if(m<r)  query(rc,m+1,y);
	}
	return;
}
int main()
{
	freopen("faithful.in","r",stdin);
	freopen("faithful.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d",&mo[i]);
	build(1,1,n);
	for(int i=1;i<=k;i++)
	{
		scanf("%d%d",&l,&r);
		minn=INF;
		query(1,1,n);
		printf("%d",minn);
	}
	return 0;
}