#include <fstream>
#include <cmath>
using namespace std;

ifstream cin("rmq.in");
ofstream cout("rmq.out");
int x,y,n,m,j,i,a[100005],p[100005][25],aux,lg;
int main()
{
    cin>>n>>m;
    for(i=1; i<=n; ++i)
    {
        cin>>a[i];
    }

    for(i=0; i<=(int)log2(n); ++i)
    {
        for(j=1; j<=n; ++j)
        {
            if(i==0)
            {
                p[j][i]=a[j];
            }
            else
            if(j+(1<<(i-1)) <=n)
            {
                p[j][i]=min(p[j][i-1],p[j+(1<<(i-1))][i-1]);
            }
        }
    }

    for(i=1; i<=m; ++i)
    {
        cin>>x>>y;
        aux=y-x+1;
        lg=(int)log2(aux);

        cout<<min(p[x][lg], p[y-(1<<lg)+1][lg])<<"\n";
    }
    return 0;
}