#include <iostream>
#include <algorithm>
#include <stdio.h>
#define NMax 100009
#define LgMax 21
using namespace std;
int Rmq[LgMax][NMax];
int Q,N,x,y,mij;
int lg[NMax],v[NMax];

void Build()
{
    for(int i=2;i<=N;i++)
        lg[i]=lg[i/2]+1;

    for(int i=1;i<=N;i++)
        Rmq[0][i]=v[i];

    for(int i=1;i<=N;i++)
        for(int j=1;j<=N-(1<<i)+1;j++)
        Rmq[i][j]=min(Rmq[i-1][j],Rmq[i-1][j+(1<<(i-1))]);
}

int Query(int x,int y)
{
    if(x>y)
        swap(y,x);
    int mij=lg[y-x+1];
    return min(Rmq[mij][x],Rmq[mij][y-(1<<mij)+1]);

}

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

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

    Build();
    for(int i=1;i<=Q;i++)
    {
        scanf("%d%d",&x,&y);
        printf("%d\n",Query(x,y));
    }

}