#include <fstream>

using namespace std;

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

int n, m, d[18][100001], log[100001], sub, lsub, i, t, j, a, b, interval;

int main(){
    log[1] = 0;
    for(i=2;i<=100000;i++)
        log[i] = log[i/2] + 1;

    fin>>n>>m;
    for(i=1;i<=n;i++)
        fin>>d[0][i];
    for(i=1;i<=log[n]+1;i++){
        t = (1<<i);
        for(j=1;j<=n;j++){
            d[i][j] = d[i-1][j];
            if(t/2 + j <= n)
                d[i][j] = min(d[i][j], d[i-1][t/2 + j]);
        }
    }
    while(m--){
        fin>>a>>b;
        interval = b-a+1;
        sub = log[interval];
        lsub = (1<<sub);
        fout<<min(d[sub][a], d[sub][b-lsub+1])<<"\n";
    }
    return 0;
}