#include <iostream>
#include <vector>
#include <fstream>
#define inf (1<<30)
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

vector<vector<int> > RMQ;
int n,m,x,y;

int min(int x, int y)
{
    if (x<y) return x;
             return y;
}

int search(int x, int y)
{
    int dist;
    if (x==y) return RMQ[x][0];
    else{

        for(dist=0; x+(1<<dist)-1 <=y; dist++){}
        dist--;
        return min(RMQ[x][dist], search(x+(1<<dist)-1, y) );

    }


}

int main()
{


    f>>n>>m;

    RMQ.resize(n+1);

    for(int i=1; i<=n; i++)
    {
        f>>x;
        RMQ[i].push_back(x);
    }
//generare
    for(int dist=1; (1<<dist) <=n ; dist++)
        for(int i=1; i<=n - (1<<dist)+1 ; i++)
            RMQ[i].push_back(min(RMQ[i][dist-1], RMQ[i+(1<<dist)-1][dist-1]));
//generare

    for(int i=1; i<=m; i++)
    {
        f >> x >> y;
        g << search(x,y) << "\n";
    }


    return 0;
}