#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int d[1000][1000],i,j,m,n,x,y,k;
int log(int x)
{int nr=0;
    while (x>1)
{x/=2;
    nr++;
}
    return nr;
}
int minim(int x,int y)
{if (x<y) return x;
else return y;

}
int putere(int n)
{int p=1;
    while(n>0)
    {p*=2;
        n--;
    }
    return p;
}


int main()
{f>>n>>m;
for (i=1;i<=n;i++)
f>>d[0][i];

for (i=1;i<=log(n);i++)
for (j=1;j<=n;j++)
d[i][j]=minim(d[i-1][j],d[i-1][j+putere(i-1)]);
for (i=1;i<=m;i++)
{f>>x>>y;
k=log(y-x+1);
g<<min(d[k][x],d[k][y-putere(k)+1])<<'\n';
}
}