#include <fstream>
#include <cmath>
#define ll long long int
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int i,j,p,e,n,q,k,rasp,ex;
int v[200002];
int m[22][300002];
int main()
{
cin>>n>>q;
for(i=1;i<=n;++i) {cin>>v[i];m[0][i]=v[i];}
for(j=1;j<=20;++j) for(i=1;i+(1<<j)<=n;++i)
if (m[j-1][i]<m[j-1][i+(1<<j)])
m[j][i]=m[j-1][i+(1<<j)];
else m[j][i]=m[j-1][i];
for(i=1;i<=q;++i)
{
    cin>>p>>e;
    rasp=m[0][p];
    while(e-p)
    {
        ex=e-p;
        for(k=21;k;--k)if(ex&(1<<k))break;
        if (m[k][p]<rasp)rasp=m[k][p];
        p+=1<<k;
    }
    cout<<rasp<<'\n';
}
return 0;
}