#include <fstream>

using namespace std;

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

const int MAX_N = 100000;

int n, m, v[MAX_N+1], p2[18*MAX_N];
int rmq[18][MAX_N];

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

int main()
{
    int a, b, i, j, log;
    in >> n >> m;
    for(i = 1; i <= n; i++){
        in >> v[i];
        rmq[0][i] = v[i];
    }
    p2[1] = 0;
    for(i = 2; i <= n; i++){
        p2[i] = p2[i/2] + 1;
    }
    for(i = 1; (1<<i) <= n; i++){
        for(j = 1; j <= n-(1<<i)+1; j++){
            rmq[i][j] = minim(rmq[i-1][j],rmq[i-1][(j+(1<<(i-1)))]);
        }
    }
    for(i = 1; i <= m; i++){
        in >> a >> b;
        log = p2[b-a+1];
        out << minim(rmq[log][a], rmq[log][b-(1<<log)+1]) << "\n";
    }
    return 0;
}