#include <fstream>

using namespace std;

int a[19][100010],n,m,i,x,y,k;
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[0][i];
    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[i][j]=min(a[i-1][j],a[i-1][j+k]);
    }
    for (; m; m--) {
        in>>x>>y;
        j=31-__builtin_clz(y-x+1);
        out<<min(a[j][x-1],a[j][y-(1<<j)])<<"\n";
    }
    return 0;
}