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

using namespace std;

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

int n,t,i,j,m,k,cop_n,a[18][100006],x,y;

int main()
{
    f >> n >> t;

    for(i = 1;i <= n;i++)
        f >> a[0][i];

    m = log2(n);
    k = 1;
    cop_n = n - 1;

    for(i = 1;i <= m;i++)
    {
        for(j = 1;j <= cop_n;j++)
            a[i][j] = min(a[i - 1][j], a[i - 1][j + k]);
        k *= 2;
        cop_n = n - 2*k + 1;
    }

    for(i = 1;i <= t;i++)
    {
        f >> x >> y;
        k = log2(y - x + 1);
        m = pow(2,k);
        g << min(a[k][x],a[k][y - m + 1]) << '\n';
    }
    return 0;
}