#include <iostream>
#include <fstream>
#define Nmax 100005
#define Lmax 20
#include <algorithm>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n;
int RMQ[Lmax][Nmax];
int lg[Nmax];
void build()
{
    int i,j,p;

    for(i=1;(1<<i)<=n;i++)
        for(j=1;j<=n-(1<<i)+1;j++)
           RMQ[i][j]=min(RMQ[i-1][j],RMQ[i-1][j+(1<<(i-1))]);
}

int main()
{
   int i,m;
   fin>>n>>m;
   for(i=1;i<=n;i++)
    fin>>RMQ[0][i];

    build();

    for(i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(i=1;i<=m;i++)
        {
            int x,y;
        fin>>x>>y;
        int a=lg[y-x];
        fout<<min(RMQ[a][x],RMQ[a][y+1-(1<<a)])<<"\n";
    }



    return 0;
}