#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[17][100001],n,m,a[100001],p2[100001];
void Putere()
{
    int i;
    p2[1]=0;
    for(i=2;i<=n;i++)
        p2[i]=p2[i/2]+1;
}
void RMQ()
{
    int i,j;
    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++)
      rmq[i][j]=min(rmq[i-1][j],
                    rmq[i-1][j+(1<<(i-1))]);
}
int main()
{
    int i,x,y,L,k,rez;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>a[i];
    Putere();
    RMQ();
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L=y-x+1;
        k=p2[L];
        rez=min(rmq[k][x],rmq[k][y-(1<<k)+1]);
        fout<<rez<<"\n";
    }
    return 0;
}