#include<fstream>
#include<algorithm>
#include<vector>
#define pb push_back
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int DN=1e5+5;
int n,m,dp[20][DN],a[DN],pz,lg[DN],f,g,z,dif;
int main()
{
	fin>>n>>m;
	for(int i=1;i<=n;i++)
		fin>>a[i];
	for(int i=n;i>0;i--)
	{
		for(int j=19;j>=0;j--)
			if((1<<j)<=i)
			{
				lg[i]=j;
				break;
			}
		for(int j=0;j<20;j++)
		{
			if(j==0)
			{
				dp[j][i]=a[i];
				continue;
			}
			dp[j][i]=dp[j-1][i];
			pz=i+(1<<(j-1));
			if(pz<=n)
				dp[j][i]=min(dp[j-1][i],dp[j-1][pz]);
		}
	}
	while(m--)
	{
		fin>>f>>g;
		z=lg[g-f+1];
		dif=g-f+1-(1<<z);
		fout<<min(dp[z][f],dp[z][f+dif])<<'\n';
	}
}