#include <iostream> 
#include <cstdio> 
#include <fstream> 
#include <algorithm> 
#include <cmath> 
#include <deque> 
#include <vector> 
#include <queue> 
#include <string> 
#include <cstring> 
#include <map> 
#include <stack> 
#include <set>
#define ghb great handsome boy;
using namespace std;
typedef long long ll;
typedef int itn;
const int max_m=100000;
int m,n,a[max_m],r[max_m][32],x,y;
inline void read()
{
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++)
	scanf("%d",&a[i]);
}
inline void rmq()
{
	for(int i=1;i<=m;i++)r[i][0]=a[i];
	for(int i=1;i<20;i++)
	for(int j=1;j<=m;j++)
	{
	if(j+(1<<i)-1<=m)
	r[j][i]=min(r[j][i-1],r[j+(1<<(i-1))][i-1]);
}
}
inline int q(int x,int y)
{
	int z=y-x;
	int h=0;
	while(1<<(h+1)<=z+1)h++;//cout<<h;
/*	while(z>=1)
	{
		h++;
		z/=2;
	}cout<<h;*/
	cout<<min(r[x][h],r[y-(1<<h)+1][h])<<" ";
} 
inline int solve()
{
	read();
	rmq();
/*	for(int i=1;i<=m;i++)
	for(int j=1;j<=4;j++)
	cout<<r[i][j];*/
	for(int k=1;k<=n;k++)
	{
		scanf("%d%d",&x,&y);
		q(x,y);
	}
}
int main()
{
	freopen("faithful.in","r",stdin);
		freopen("faithful.out","w",stdout);
    solve();
	fclose(stdin);
	fclose(stdout);
	return 0;
}