#include <fstream>
#define DIMN 100010

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

int d[20][DIMN];
int v[DIMN], x, y, i, j, p, n, m;

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

int main(){
    fin>>n>>m;
    for (i=1;i<=n;i++)
        fin>>d[0][i];
    // v[i] = cea mai mare putere de 2 <= i
    for (i=2;i<=n;i++)
        v[i] = 1 + v[i>>1];

    for (j=1; (1<<j) <= n; j++)
        for (i=1;i<=n; i++)
            d[j][i] = minim(d[j-1][i], d[j-1][i+(1<<(j-1))]);
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        p = v[y-x+1];
        fout<<minim(d[p][x], d[p][y-(1<<p)+1])<<"\n";
    }


    return 0;
}