#include <fstream>
#define NMax 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int N, M, Log2[NMax], RMQ[20][NMax], A[NMax];
void Read()
{
    fin>>N>>M;
    for(int i=1;i<=N;i++)
        {
            fin>>A[i];
        }
}

void BuildLog2()
{
    for(int i=2;i<=N;i++)
        {
            Log2[i]=Log2[i/2]+1;
        }
}

void BuildRMQ()
{
    for(int i=1;i<=N;i++)
        RMQ[0][i]=A[i];
    for(int i=1;(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))]);
}


void Solve()
{
    int diff, l;
    BuildLog2();
    BuildRMQ();
    while(M--)
    {
        int x, y;
        fin>>x>>y;
        if(x>y)
            swap(x,y);
        diff=y-x+1;
        l=Log2[diff];
        fout<<min(RMQ[l][x], RMQ[l][y-(1<<l)+1])<<"\n";

    }
}
int main()
{
    Read();
    Solve();
    return 0;
}