#include<stdio.h>

#define nmax 100010
#define nlog 32

int n,m,M[nmax][nlog],a[nmax],l[nmax];

inline int min(int a,int b)
{
    return (a<b?a:b);
}

int main()
{
    int k,b,c,p;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i)
        {
        scanf("%d",&a[i]);
        M[i][0]=a[i];
        }
        
    for(int i=2;i<=n;++i)
        l[i]=l[i>>1] + 1;
    
    for(int i=1 , q=2 ; q<=n ; ++i , q=(q<<1) )
        for(int j=1 , p=(q>>1);j<=n;++j)
            M[j][i]= min(  M[j][(i-1)]  , M[ min(j+q-1,n) -p +1][(i-1)]);
            
    for(;m;--m)
        {
        scanf("%d%d",&b,&c);
        k=l[c-b+1];
        p=1<<k;
        printf("%d\n",min(M[b][k],M[c-p+1][k]));
        }
    
    return 0;
}