#include <cstdio>
using namespace std;
int k,x,y,m,l,n,p,i,j,a[100010][17];
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",&a[0][i]);
    a[0][0]=n;
    p=2;
    l=1;
    i=0;
    while(p<=n)
    {
        for(i=1;i+p-1<=n;i++)
        {
            a[l][0]++;
            if(a[l-1][i]<a[l-1][i+p/2])
                a[l][i]=a[l-1][i];
            else  a[l][i]=a[l-1][i+p/2];
        }
        p=p<<1;
        l++;
        i=0;
    }
  /*  for(i=1;i<=l;i++)
    {
        for(j=1;j<=a[i][0];j++)
        printf("%d ",a[i][j]);
        printf("\n");
    }*/
    while(m)
    {
        m--;
        p=1;
        k=0;
        scanf("%d%d",&x,&y);
        if(x==y)
        {
            printf("%d\n",a[0][x]);
        }
        else
        {
            while(y-x+1>p)p=p<<1,k++;
        p/=2;k--;
        if(a[k][x]<a[k][y-p+1])
        printf("%d\n",a[k][x]);
        else printf("%d\n",a[k][y-p+1]);
        }
    }
    return 0;
}