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

int n, m, rmq[18][100003], x, y, k,aux, lg[100003];

int main()
{
    f>>n>>m>>aux; rmq[0][1]=aux;
    for (int i=2; i<=n; ++i)
        f>>aux, rmq[0][i]=aux, lg[i]=lg[i/2]+1;

    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))]);

    for (int i=1; i<=m; ++i)
    {
        f>>x>>y; k=lg[y-x+1];
        g<<min(rmq[k][x], rmq[k][y-(1<<k)+1])<<'\n';
    }
    return 0;
}