#include <stdio.h>

int a[100010][20],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 () {
    FILE * in=fopen ("rmq.in","r");
    FILE * out=fopen ("rmq.out","w");
    fscanf (in,"%d%d",&n,&m);
    for (i=0; i<n; i++) fscanf (in,"%d",&a[i][0]);
    lg=31-__builtin_clz(n);
    for (i=1,k=1; i<=lg; i++,k<<=1) {
        x=n-(1<<i);
        for (j=0; j<=x; j++) a[j][i]=min(a[j][i-1],a[j+k][i-1]);
    }
    for (; m; m--) {
        fscanf (in,"%d%d",&x,&y);
        j=31-__builtin_clz(y-x+1);
        fprintf (out,"%d\n",min(a[x-1][j],a[y-(1<<j)][j]));
    }
    fclose (in);
    fclose (out);
    return 0;
}