#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,j,k,l,p,x,y,e[100001],r[17][100001];
int main() {
    fin>>n>>m;
    for (i=1;i<=n;i++)
        fin>>r[0][i];
    for (p=1;(1<<p)<=n;p++)
        for (i=1;i<=n;i++) {
            r[p][i]=r[p-1][i];
            j=i+(1<<(p-1));
            if (j<=n && r[p-1][j]<r[p][i])
                r[p][i]=r[p-1][j];
        }
    e[1]=0;
    for (i=2;i<=n;i++)
        e[i]=e[i/2]+1;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        k=e[y-x+1];
        l=(1<<k);
        fout<<min(r[k][x],r[k][y-l+1])<<"\n";
    }
    return 0;
}