#include <bits/stdc++.h>

using namespace std;

long long int cer,t,n,m,a[200005],lg[200005],rmq[18][18],b,c,x,sh,diff,y,l,r,i,j,ok,nr,ans,k,mini,maxi,poz,mod=1e9+7;
string s;

void solve()
{
    cin>>n>>m;
	for(i=1;i<=n;i++)
		cin>>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]);
		}
	for(i=1;i<=m;i++)
	{
		cin>>x>>y;
		diff=y-x+1;
		l=lg[diff];
		sh=diff-(1<<l);
		cout<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
	}
}


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    solve();
    return 0;
}