#include <fstream>
#define DIM 100010

using namespace std;

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

int D[20][DIM];
int P[DIM];

int p, n, m, a, b, i, j, x;

inline int minim(int a, int b) {
    return ( a<b ? a : b );
}


int main() {
    fin>>n>>m;

    for (i=1;i<=n;i++) {
        fin>>x;
        D[0][i] = x;
    }

    P[1] = 0;
    for (i=2;i<=n;i++)
        P[i] = 1 + P[i/2];

    for (i=1; (1<<i) <= n; i++) {
        for (j=1;j<=n;j++) {
            D[i][j] = D[i-1][j];
            if (j + (1<<(i-1)) <= n && D[i][j] > D[i-1][ j + (1<<(i-1)) ])
                D[i][j] = D[i-1][ j + (1<<(i-1)) ];
        }
    }


    for (i=1;i<=m;i++) {
        fin>>a>>b;

        p = P[b-a+1];

        fout<<minim( D[p][a]  , D[p][b- (1<<p) +1 ]  )<<"\n";
    }

    return 0;
}