#include <fstream>
#define NMax 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N,M,X[NMax],RMQ[20][NMax],Log2[NMax];
int main()
{
    int i,j;
    fin>>N>>M;

    for(i=1;i<=N;i++)
        fin>>X[i];

    for(i=2;i<=N;i++)
        Log2[i]=Log2[i/2]+1;

    for(i=1;i<=N;i++)
        RMQ[0][i]=i;

    for(i=1;(1<<i)<=N;i++)
        for(j=1;j<=N-(1<<i)+1;j++)
            if(X[RMQ[i-1][j]]>X[RMQ[i-1][j+(1<<(i-1))]])
                RMQ[i][j]=RMQ[i-1][j+(1<<(i-1))];
            else
                RMQ[i][j]=RMQ[i-1][j];

    while(M--)
    {
        int x,y;
        fin>>x>>y;
        int lungime=y-x+1;
        int k=Log2[lungime];
        fout<<min(X[RMQ[k][x]],X[RMQ[k][y-(1<<k)+1]])<<"\n";
    }
    return 0;
}