#include<stdio.h>
#include<algorithm>
int n,m,v[100005],mat[20][100005],lg[100005];

#define min(a,b) (a)<=(b) ? (a):(b)
void Compute()
{
	int aux;
	lg[1]=0;
	for(int i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;

	for(int i=1;i<=n;i++)
		mat[0][i]=v[i];
	for(int i=1; (1<<i) <=n;i++)
		for(int j=1;j<=n - (1<<i) +1 ; j++)
		{
			aux=1<<(i-1);
			mat[i][j]=min(mat[i-1][j],mat[i-1][j+aux]);
		}
    }

int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);

	scanf("%d %d",&n,&m);

	for(int i=1;i<=n;i++)
		scanf("%d",&v[i]);
    Compute();
	int x,y,l;
	for(int i=1;i<=m;i++)
	{
		scanf("%d %d",&x,&y);
		l=lg[y-x+1];
		printf("%d\n",min(mat[l][x],mat[l][y-(1<<l)+1]));
	}
}