#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

const int dim = 100005;

int n,m,a[dim],rmq[20][dim],lg[dim];

int main()
{
    in >> n >> m;
    for (int i=1; i<=n; i++)
    {
        in >> a[i];
        rmq[0][i] = a[i];
    }
    for (int j=1;  (1<<j) <= n; j++)
    {
        for (int i=1; i + (1<<j) - 1 <=n; i++)
        {
            rmq[j][i] = min(rmq[j-1][i] , rmq[j-1][ i + (1<<(j-1))]);
        }
    }
    lg[1] = 0;
    for (int i=2; i<=n; i++)
    {
		lg[i] = lg[i/2] + 1;
    }
    int q,x,y,dif,log2;
    while (m)
    {
        in >> x >> y;
        dif = y-x+1;
        log2 = lg[dif];
        out << min(rmq[log2][x] , rmq[log2][y - (1<<log2) + 1]) << "\n";
        m--;
    }
    return 0;
}