#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100002;

int N, Q;

int a[NMAX];
int rmq[18][NMAX];
int lg[NMAX];

int x, y;
void RMQ()
{
    lg[2]=1;
    for(int i = 3; i <= NMAX - 2; ++i)
        lg[i] = lg[i/2] + 1;

    fin >> N >> Q;

    for(int i = 0; i <= 17; ++i)
        for(int j = 1; j <= NMAX - 1; ++j)
             rmq[i][j] = 2000000000;

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

    for(int i = 1; i <= lg[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) )]);

    /*for(int i = 0; i <= lg[N]; ++i)
    {
        for(int j = 1; j <= N - (1 << i) + 1; ++ j)
            fout << rmq[i][j] << " ";
        fout << '\n';
    }*/

    for(int q = 1; q <= Q; ++q)
    {
        fin >> x >> y;
        int l = y - x + 1;
        l = lg[l];

        fout << min(rmq[l][x], rmq[l][y - (1 >> l) + 1]) << "\n";
    }

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