#include <fstream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int A[19][100100],i,j,P[100100],a,b,n,m;

void process()
{
    for(int i = 1; (1 << i) <= n; i ++)
        for(int j = 1; j <= n; j ++){

            A[i][j] = A[i - 1][j];

            if (j + (1 << (i - 1)) <= n && A[i][j] > A[i - 1][j + (1 << (i - 1))])
                A[i][j] = A[i - 1][j + (1 << (i - 1))];
        }

}
int RMQ(int a, int b)
{
    return min(A[  P[b - a + 1]  ][a],A[  P[b - a + 1]  ][b - ( 1 << P[b - a + 1] ) + 1]);
}
int main()
{
    fin >> n >> m;

    for(i = 1; i <= n; i ++)
        fin >> A[0][i];

    process();

    P[1] = 0;

    for(i = 2; i <= n; i ++)
        P[i] = 1 + P[i / 2];

    for(i = 1; i <= m; i ++)
    {
        fin >> a >> b;
        fout << RMQ(a,b) << '\n';
    }
    return 0;
}