#include <bits/stdc++.h>

using namespace std;

const int NMAX=100002;
const int LMAX=18;

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

int main()
{
	
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
	
    scanf("%ld %ld",&n,&m);
	
	for(int i=1;i<=n;i++)
	    scanf("%ld", &a[i]);
	    
	for(int i=1;i<=n;i++)
	    rmq[0][i]=a[i];
	
	for(int i=1;(1 << i)<=n;i++)
	    for(int j=1;j<=n-(1 << i)+1;j++)
	    {
	    	long long t=1 << (i-1);
	    	rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+t]);
		}
		
	for(int i=1;i<=m;i++)
	{
		long long x,y;
		scanf("%ld %ld", &x, &y);
		int t=log2(y-x+1);
		printf("%ld\n",min(rmq[t][x],rmq[t][y-(1 << t)+1]));
	}
	
	return 0;
	
}