#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

int N, Q, a[100002], Lg[100002], RMQ[21][21], st, dr, lg, dif;

int main()
{
    f>>N>>Q;
    for (int i=1; i<=N; ++i) f>>a[i];
    for (int i=2; i<=N; ++i)
        Lg[i]=Lg[i/2]+1;
    for (int i=1; i<=N; ++i)
        RMQ[0][i]=a[i];

    for (int i=1;(1<<i)<=N; ++i)
        for (int j=1; j<=N-(1<<i)+1; ++j)
            RMQ[i][j]=min( RMQ[i-1][j], RMQ[i-1][j+(1<<(i-1))] );

    for (int i=1; i<=Q; ++i)
    {
        f>>st>>dr; dif=dr-st+1; lg=Lg[dif];
        g<<min(RMQ[lg][st], RMQ[lg][dr-(1<<lg)+1] )<<'\n';
    }
    return 0;
}