#include <cstdio>
#include <vector>

using namespace std;

#define NMAX 100002
#define LMAX 18

long R[LMAX][NMAX];
long N,M;
long lg[NMAX];
long A[NMAX];

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

    long i,j,l;

    scanf("%ld %ld",&N,&M);

    for (i=1;i<=N;i++)
        scanf("%ld ",&A[i]);

    lg[1]=0;
    for (i=2;i<=N;i++)
        lg[i]=lg[i/2]+1;

    for (i=1;i<=N;i++)
        R[0][i]=A[i];

    for (i=1; (1 << i) <=N;i++)
        for (j=1;j <= N - (1 << i)+1;j++)
        {
        l=1<<(i-1);
        R[i][j]= min( R[i-1][j] , R[i-1][j+l] );
        }

    long x,y,diff,sh;

    for (i=1;i<=M;i++)
    {
        scanf("%ld %ld",&x,&y);

        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        printf("%ld\n",min(R[l][x],R[l][x+sh]) );
    }
    return 0;
}