#include <fstream>
#include <math.h>
using namespace std;

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

int main()
{
    int mini[100000][20];
    int m, n;
    fin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        fin >> mini[i][0];
    }
    for (int j = 1; (1 << j) < n; j++)
    {
        for (int i = 0; (1 << j) + i - 1 < n; i++)
        {
            mini[i][j] = min(mini[i][j - 1], mini[i + (1 << (j - 1))][j - 1]);
        }
    }
    for (int i = 0; i < m; i++)
    {
        int l, r;
        fin >> l >> r;
        r--;
        l--;
        int pwr = (int)log2(r - l + 1);
        if ((1 << pwr) == r - l + 1)
        {
            fout << mini[l][pwr] << '\n';
        }
        else
        {
            fout << min(mini[l][pwr], mini[r - (1 << pwr) + 1][pwr]) << '\n';
        }
    }
}