#include <iostream>
#include <fstream>

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

const int NMAX = 100000 + 5;


int N, M;
int v[NMAX];
int rmq[NMAX][20], lg[NMAX];

void Prep()
{
    lg[2] = 1;
    for (int i = 3; i < NMAX; i++) lg[i] = lg[i >> 1] + 1;
    for (int j = 1; j <= lg[N]; j++)
        for (int i = 1; i <= N - (1 << j) + 1; i++)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
}

int RMQ(int x, int y)
{
    int dif = lg[y - x + 1];
    return min(rmq[x][dif], rmq[y - (1 << dif) + 1][dif]);
}

void read()
{
    fin >> N >> M;

    for (int i = 1; i <= N; ++i)
    {
        fin >> v[i];
        rmq[i][0] = v[i];
    }

    Prep();

    int x, y;
    for (int i = 1; i <= M; ++i)
    {
        fin >> x >> y;
        fout << RMQ(x, y) << "\n";
    }

}


int main()
{
read();
    return 0;
}