#include <fstream>

using namespace std;

int a[100010][19],n,m,i,x,y,k,b[19];
short j,lg;

inline int min (int a,int b)
{
    if (a<b) return a;
    return b;
}

int main () {
    ifstream in ("rmq.in");
    ofstream out ("rmq.out");
    in>>n>>m;
    for (i=0; i<n; i++) in>>a[i][0];
    lg=31-__builtin_clz(n);
    for (i=1,k=1; i<=lg; i++,k<<=1) {
        x=n-k;
        for (j=0; j<=x; j++) a[j][i]=min(a[j][i-1],a[j+k][i-1]);
    }
    for (j=0; j<19; j++) b[j]=1<<j;
    for (; m; m--) {
        in>>x>>y;
        j=31-__builtin_clz(y-x+1);
        out<<min(a[x-1][j],a[y-b[j]][j])<<"\n";
    }
    return 0;
}