#include <cstdio>
using namespace std;
int v[25][100001], p[100001],m,n,i,j,b,a,lg,x,y;
int main () {

    freopen ("rmq.in","r",stdin);
    freopen ("rmq.out","w",stdout);

    scanf ("%d%d", &n, &m);
    for (i=1;i<=n;i++)
        scanf ("%d", &v[0][i]);
    for (i=1;(1<<i)<=n;i++) {

        b=(1<<(i-1));
        for (j=1;j<n;j++){
            x=j+b;

            if (v[i-1][j]<v[i-1][x] && v[i-1][x]>0)
                v[i][j]=v[i-1][j];
            else
                v[i][j]=v[i-1][x];
        }
    }
    p[1]=0;
    for (i=2;i<=100000;i++)
        p[i]=1+p[i/2];
    for (i=1;i<=m;i++) {
        scanf ("%d%d", &x , &y);
        lg=y-x+1;
        b=0;
        b=(b | (1<<p[lg]));
        if (v[p[lg]][x]< v[p[lg]][y-b+1])
            printf ("%d\n", v[p[lg]][x] );
        else
            printf ("%d\n", v[p[lg]][y-b+1]);
    }


    return 0;
}