#include <fstream>
#define nmax 100001
using namespace std;
ifstream is ("rmq.in");
ofstream os ("rmq.out");

int D[20][nmax], PW[nmax], LG[nmax];
int N, M, x, y, lg, len;

int main()
{
    is >> N >> M;
    for(int i = 1; i <= N; ++i)
        is >> D[0][i];

    PW[0] = 1;
    for(int i = 1; i <= 16; ++i)
        PW[i] = (PW[i-1]<<1);

    LG[2] = 1;
    for(int i = 3; i <= 25; ++i)
        LG[i] = LG[i>>1]+1;

    for(int i = 1; i <= LG[N]; ++i)
        for(int j = 1; j+PW[i-1] <= N; ++j)
            D[i][j] = min(D[i-1][j], D[i-1][j+PW[i-1]]);

    for(int i = 1; i <= M; ++i)
    {
        is >> x >> y;
        len = y-x+1;
        lg = LG[len];
        os << min(D[lg][x], D[lg][y-PW[lg]+1]) << "\n";
    }


    return 0;
}