#include <fstream>
#include <cmath>
using namespace std;

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

const int NMax = 100000;
const int LMax = 20;

int N,M;
int X[NMax];
int RMQ[LMax][NMax];

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

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

void SolveandPrint()
{
    while(M--)
    {
        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;
}