#include <fstream>
#include <cmath>
using namespace std;

const int NMAX = 100005;
const int PMAX = 20;

int rmq[PMAX][NMAX], a[NMAX], n, m;

int log_2(int n)
{
    if (n == 1) return 0;
    return 1 + log_2(n >> 1);
}

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

int main()
{
    fin >> n >> m;

    for (int i = 1; i <= n; ++i)
        {
            fin >> a[i];
            rmq[0][i] = a[i];
        }

    for (int i = 1; (1 << i) <= n; ++i)
        for (int j = 1; j <= n - (1 << i) + 1; ++j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);

    int l, r;

    while(m--)
    {
        fin >> l >> r;

        int diff = r - l + 1;

        int lun = log_2(diff), sh = diff - (1 << lun) ;

        fout << min(rmq[lun][l], rmq[lun][l + sh]) << "\n";
    }


    return 0;
}