#include <fstream>

using namespace std;
int d[50][100001],n,m,i,j,x,y,k,a[32];
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        f>>d[0][i];
    for(i=1;i<=15;i++)
        for(j=1;j<=n;j++)
    {
        if(j+(1<<(i-1)))
        d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
    }
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        for(j=0;j<=30;j++)
        if((1<<j)>y-x){j--;break;}
        k=j;
        g<<min(d[k][x],d[k][y-(1<<(k))+1])<<"\n";
    }
    return 0;
}