#include <cstdio>
#include <algorithm>
using namespace std;

const int NMAX=100005;
int v[NMAX],lg[NMAX],r[NMAX][20];

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

    int n,m,i,j,l,k,x,y;

    scanf("%d%d",&n,&m);

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

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

    //for(i=1;i<=n;i++) printf("%d ",log[i]);


    for(i=1;i<=n;i++)
    {
        for(j=0;(1<<j)<=i;j++)
        {
            if(j==0)
            {
                r[i][0]=v[i];
                continue;
            }

            k=i-(1<<(j-1));
            r[i][j]=min(r[i][j-1],r[k][j-1]);
        }
    }

    /*for(i=1;i<=n;i++)
    {
        for(j=0;j<=2;j++) printf("%d ",r[i][j]);
        printf("\n");
    }*/

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

        l=lg[y-x+1];

        printf("%d\n",min(r[y][l],r[x+(1<<l)-1][l]));
    }

    return 0;
}