#define MAX_N 100000
#define MAX_SQRT_N 316

#include <fstream>
using namespace std;

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

int n, m, a[MAX_N + 1], b[MAX_SQRT_N + 1];

int main()
{
    fin >> n >> m;
    for (int i = 1, ib = 0; i <= n; ++i)
    {
        fin >> a[i];
        if ((i % MAX_SQRT_N) == 1)
            b[++ib] = a[i];
        else if (a[i] < b[ib])
            b[ib] = a[i];
    }
    for (int i = 1; i <= m; ++i)
    {
        int x, y, r;
        fin >> x >> y;
        r = a[x++];
        while ((x <= y) && ((x % MAX_SQRT_N) != 1))
        {
            if (a[x] < r)
                r = a[x];
            ++x;
        }
        while ((x <= y) && ((y % MAX_SQRT_N) != 0))
        {
            if (a[y] < r)
                r = a[y];
            --y;
        }
        if (x > y)
        {
            fout << r << '\n';
            continue;
        }
        for (int xb = ((x - 1) / MAX_SQRT_N) + 1, yb = ((y - 1) / MAX_SQRT_N) + 1; xb <= yb; ++xb)
        {
            if (b[xb] < r)
                r = b[xb];
        }
        fout << r << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}