#include<fstream>
#include<vector>
using namespace std;
#define nn 100005
#define min(a,b) a<b?a:b
int rmq[18][nn];
vector<int> v(1,0),lg(1,0);//ca sa pot parcurge de la 1
int m,n;
int main()
{
	long int a,b,i,j,l;
	ifstream fin("rmq.in");
	fin>>n>>m;
	for(i=1;i<=n;++i)
	{
		fin>>a;
		v.push_back(a);
	}
	
	lg.push_back(0);
    for (i=2;i<=n;i++)
        lg.push_back(lg[i/2]+1);
    for (i=1;i<=n;i++)
        rmq[0][i]=v[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 diff,sh;
    FILE *f=fopen("rmq.out","w"); 
    for (i=1;i<=m;i++)
    {
        fin>>a>>b;
        diff=b-a+1;
        l=lg[diff];
        sh=diff-(1<<l);
        fprintf(f,"%d\n",min(rmq[l][a],rmq[l][a+sh]));
    }   
	fin.close();
	fclose(f);	
	return 0;
}