#include<fstream>
#include<algorithm>
using namespace std;
int n,m,i,j,lg[10001],a[20][100001],l,x,y;
int main()
{
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    f>>n>>m;
    for(i=1;i<=n;++i)
    f>>a[0][i];
    lg[1]=0;
    for(i=2;i<=n;++i)
    lg[i]=lg[i>>1]+1;

    for(i=1;i<=lg[n];++i)
    for(j=1;j<=n-(1<<i)+1;++j)
    a[i][j]=min(a[i-1][j],a[i-1][j+(1<<i)-1]);

    for(i=1;i<=m;++i)
    {
        f>>x>>y;
        l=lg[y-x+1];
        g<<min(a[l][x],a[l][y+1-(1<<l)])<<"\n";
    }
    return 0;
}