#include<bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long int i,j,l,rmq[18][100003],n,m,lg[100003],a[100003];

int main()
{
	fin>>n>>m;
	for(i=1;i<=n;i++)
	{
		fin>>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++)
    {
        fin>>x>>y;
         
        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        fout<<min(rmq[l][x],rmq[l][x+sh])<<endl;
    }   
	return 0;
}