#include <cstdio>

using namespace std;
int r[20][100002],n,m,x,y,lg[100002],a[100002],i,j,k;
int min(int a,int b)
{
    if (a>b) return b;
       else return a;
}
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[i]),r[0][i]=a[i];
    lg[1]=0;
    for (i=2;i<=n;i++) lg[i]=lg[i/2]+1;
    for (i=1;(1<<i)<=n;i++)
       for (j=1;j<=n-(1<<n)+1;j++)
           r[i][j]=min(r[i-1][j],r[i-1][j+(1<<i)]);
    for (i=1;i<=m;i++)
        {
            scanf("%d %d",&x,&y);
            k=lg[y-x+1];
            printf("%d\n",min(r[k][x],r[k][x-(1<<k)+1]));
        }
    return 0;
}