#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");

int n, i, j, p,x, y, k, m[100005][20], a[100005];


int main()
{
	cin>>n>>p;
	for (i=0; i<n; ++i) cin>>a[i];
	
	for(i=0; i<n; ++i) m[i][0]=i;
	
		for (j=1; 1<<j <=n; ++j)
			for(i=0; i+(1<<j)-1 <n; ++i)
			
				if (a[m[i][j-1]]<a[m[i+(1<<(j-1))][j-1]])
					m[i][j]=m[i][j-1];
					else m[i][j]=m[i+(1<<(j-1))][j-1];

	
	for (i=1; i<=p; ++i)
	{
		cin>>x>>y; --x; --y;
		k=log10(y-x+1)/log10(2); 
		
		cout<<min(a[m[x][k]], a[m[y- (1<<k)+1][k]])<<'\n';
	}

    
        
    return 0;
}