#include <fstream>
#define nmax 100004
using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

int Lg[nmax],V[nmax],RMQ[18][nmax];

inline int _min(int a,int b){if(a<b)return a;return b;}

inline int Query(int a,int b)
{
    int Nivel = Lg[b-a+1];
    int Diferenta = b-a+1-(1<<Nivel);
    return _min(RMQ[Nivel][a],RMQ[Nivel][a+Diferenta]);
}

int main()
{
    int N,Q,i,j,a,b;
    in>>N>>Q;
    for(i=1;i<=N;i++)in>>V[i];
    Lg[1] = 0;
    for(i=2;i<=N;i++)Lg[i]=Lg[i/2]+1;
    for(i=1;i<=N;i++)RMQ[0][i] = V[i];
    for(i=1;(1<<i)<=N;i++)
        for(j=1;j<=N-(1<<i)+1;j++)
            RMQ[i][j] = _min(RMQ[i-1][j],RMQ[i-1][j+(1<<i-1)]);

    while(Q--)
    {
        in>>a>>b;
        out<<Query(a,b)<<'\n';
    }
    return 0;
}