#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100001;

int N, Q;
int a[NMAX];
int x, y;
int log[NMAX];
int rmq[18][NMAX];

void Read()
{
    fin >> N >> Q;

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

    log[2] = 1;

    for(int i = 3; i<= N; ++i)
        log[i] = log[i/2] + 1;

    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 ) )]);

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

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

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