#include<stdio.h>

#define nmax 100010
#define nlog 32

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

void cit();
void init();
void solve();
int rmq(int,int,int);
int min(int,int);

int main()
{
    cit();
    
    init();
    
    solve();
    
    return 0;
}

int rmq(int i,int j,int k)
{
    int rez=M[i][k];
    if (rez > M[j-(1<<k)+1][k])
        rez = M[j-(1<<k)+1][k];
        
    return rez;
}

void solve()
{
    int k,b,c;
    for(int i=1;i<=m;++i)
        {
        scanf("%d%d",&b,&c);
        k=l[c-b+1];
        printf("%d\n",rmq( b , c , k ));
        }
}

void init()
{
    for(int i=2;i<=n;++i)
        l[i]=l[i>>1] + 1;
    
    for(int i=1 ; (1<<i)<=n ; ++i )
        for(int j=1;j<=n;++j)
            M[j][i]=rmq( j , min( j+(1<<i) -1 , n ) , (i-1) );
}

void cit()
{
    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];
        }
}

int min(int a,int b)
{
    if (a<b)
        return a;
    return b;
}