#include <iostream>
#include <fstream>

using namespace std;

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

int main()
{
    int N, M, i, stanga, dreapta, lungime, lg[100005], k, lint, v[20][100005];
    f>>N>>M:
    for(i=1; i<=N; i++)
        f>>v[0][i];

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

    for (i=1; i<=lg[n]+1; i++)
    {
        for (j=1; j<=n-(1<<i)+1; j++)
        {
            l = 1<<(i-1);
            v[i][j] = min(v[i-1][j], v[i-1][j+l]);
        }
    }

    for(i=1; i<=M; i++)
    {
        f>>stanga>>dreapta;
        k = lg[dreapta-stanga+1];
        lungime = (1<<k);
        g<<min(v[k][stanga], v[k][dreapta-lungime+1])<<'\n';

    }
    return 0;
}