#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");

#define N 100001

int d[20][N], lg[N];
int n,m;

void citire()
{
    in >> n >> m;

    for(int i=1; i<=n; i++)
        in >> d[0][i];
}

int main ()
{
    citire();

    lg[1]=0;
    for(int i=2; i<=n; i++)
        lg[i] = lg[i/2]+1;

    for(int i=1; i<=lg[n]; i++)
        for(int j=1; j<= n-(1<<(i-1)); j++)
            d[i][j]= min(d[i-1][j], d[i-1][j+(1<<(i-1))]);

    int x, y;
    for(int i=1; i<=m; i++)
    {
        in >> x >> y;

        int k=lg[y-x+1];

        out<<min( d[k][x], d[k][y-(1<<k)+1])<<'\n';
    }
    return 0;
}