#include<fstream>
using namespace std;
ifstream F("rmq.in");
ofstream G("rmq.out");
int n,m,i,j,b[18][100001],c[100001];
int main()
{
    for(F>>n>>m,i=1;i<=n;++i) {
        F>>j,b[0][i]=j;
    }
	for(i=2;i<=n;++i)
		c[i]=c[i/2]+1;
    for(i=1;(1<<i)<=n;++i)
    	for(j=1;j<=n+1-(1<<i);++j)
        	b[i][j]=min(b[i-1][j],b[i-1][j+(1<<(i-1))]);
    while(m--)
        F>>i>>j,n=c[j-i+1],G<<min(b[n][i],b[n][j+1-(1<<n)])<<"\n";
    return 0;
}