#include <fstream>
using namespace std;

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

/*
r[i][j] = cel mai mic element (poz) din intervalul [j-2^i+1, j]
r[i][j] = min(r[i-1][j], r[i-1][j-(1<<(i-1)))])
precalculam si vectorul lg[i] = parte intreaga din log in baza 2 din i
val = 1;
for(i=1 ; i<=n ; i++){
    if(i > (1<<val))
        val++;
    lg[i] = val;
}
q(a,b) = min(r[lg[ab]][a+ab-1], r[lg[ab]][b]), unde ab = b-a+1
*/
const int N=100000;

int x, y, p, n, i, j, m, v[100003], d[17][100003];
int minim(int x, int y){
    return x<y?x:y;
}
int main(){
    in>>n>>m;
    for(i=1; i<=n; i++)
        in>>d[0][i];
    for(i=2; i<=n; i++)
        v[i]=1+v[i>>1];
    for(i=1; (1<<i)<=n; i++)
        for(j=1; j<=n; j++)
            d[i][j]=minim(d[i-1][j], d[i-1][j+(1<<(i-1))]);
    for(i=1; i<=m; i++){
        in>>x>>y;
        p=v[y-x+1];
        out<<minim(d[p][x], d[p][y-(1<<p)+1])<<"\n";
    }
return 0;
}