#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int i,n,lo[1000005],rmq[25][200005],j,m,x,y,z;
int main()
{
    f>>n>>m;
    for(i=2; i<=n; ++i)lo[i]=lo[i/2]+1;
    for(i=1; i<=n; i++)
    {
        f>>rmq[0][i];
    }
    for(i=1; i<=lo[n]; i++)
        for(j=1; j<=n; j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        z=y-x+1;
        z=lo[z];
        g<<min(rmq[z][x],rmq[z][y-(1<<z)+1])<<'\n';
    }
    return 0;
}