#include <fstream>

using namespace std;

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

int n, q, i, j;
int x, y, k;
int v[100001];
int m[100001][16];
int lg[100001];

int main()
{
    f >> n >> q;
    for (i=1; i<=n; i++)
    {
        f >> v[i];
        m[i][0] = v[i];
    }

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

    for (i=2; i<=n; i++)
        lg[i] = lg[i / 2] + 1;

    while (q--)
    {
        f >> x >> y;
        k = lg[y - x + 1];
        g << min(m[x][k], m[y - (1 << k) + 1][k]) << "\n";
    }

    return 0;
}