// RangeMinimumQuery.cpp : Defines the entry point for the console application.
//

//#include "stdafx.h"
#include "stdio.h"
#include <vector>

using namespace std;

long int n, mm, v[100002];
long int m[100002][18];
long int lg[100002];


int minim(int x, int y)
{
	if (x<y) return x;
	return y;
}

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


	lg[0]=-1;
	for (int o=1; o<=n; ++o)
		lg[o]=lg[o/2]+1;


	scanf("%ld%ld", &n, &mm);
	for (int i=1; i<=n; i++)
	{
		scanf("%ld", &v[i]);
		m[i][0]=v[i];
	}
	for (int j=1; (1<<j)<=n; ++j)
		for (int k=1; k+(1<<j)-1<=n; ++k)
		{
			long int l=(1<<(j-1));
			m[k][j]=min(m[k][j-1],m[k+l][j-1]);
		}
	


	
	for (int oo=1; oo<=mm; ++oo)
	{
		long int a, b;
		scanf("%ld%ld", &a, &b);
		int kk=lg[b-a+1];
		printf("%d\n", min(m[a][kk],m[b-(1<<kk)+1][kk]));

	}


	
	return 0;
}
/*
#include <stdio.h>
#include <vector>

using namespace std;

#define NMAX 100002
#define LMAX 18

long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];

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

	long int i,j,l;

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

	for (i=1;i<=n;i++)
		scanf("%ld ",&a[i]);

	lg[1]=0;
	for (i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;

	for (i=1;i<=n;i++)
		rmq[0][i]=a[i];

	for (i=1; (1 << i) <=n;i++)
		for (j=1;j <= n - (1 << i)+1;j++)
		{
		l=1<<(i-1);
		rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
		}

	long int x,y,diff,sh;
	
	for (i=1;i<=m;i++)
	{
		scanf("%ld %ld",&x,&y);
		
		diff=y-x+1;
		l=lg[diff];
		sh=diff - (1<<l);
		printf("%ld\n",min(rmq[l][x],rmq[l][x+sh]) );
	}	
	return 0;
}*/