#include <stdio.h>
#define log(n) 31-__builtin_clz(n)
#define min(i,j) i<j?i:j

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

int main () {
    freopen ("rmq.in","r",stdin);
    freopen ("rmq.out","w",stdout);
    scanf ("%d%d",&n,&m);
    for (i=0; i<n; i++) scanf ("%d",&a[i][0]);
    lg=log(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+(1<<(i-1))][i-1]);
    }
    for (; m; m--) {
        scanf ("%d%d",&x,&y);
        j=log(y-x+1);
        printf ("%d\n",min(a[x-1][j],a[y-(1<<j)][j]));
    }
    fclose (stdin); fclose (stdout);
    return 0;
}