#include <fstream>
#define DM 100007
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int N,M;
int X[DM],Log2[DM],RMQ[20][DM];

void Read()
{
    fin>>N>>M;
    for(int i = 1; i<=N; i++)
        fin>>X[i];
}

void Precalculate()
{
    int i,j;

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

    for(i = 1; i<=N; i++)
        RMQ[0][i] = X[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)) ]);
}

void SolveandPrint()
{
    int i;

    for(i=1;i<=M;++i)
    {
        int x,y;
        fin>>x>>y;
        int Length = y - x + 1;
        int k = Log2[Length];
        fout << min(RMQ[k][x],RMQ[k][y - (1<<k) + 1])<<"\n";
    }
}

int main()
{
    Read();
    Precalculate();
    SolveandPrint();
    return 0;
}