#include <fstream>

using namespace std;

const int NMAX = 1e6 + 1, KMAX = 17;

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

int n, m, lg2[NMAX], t[KMAX][NMAX];

void genRMQ()
{
    for(int i = 1; (1 << i) <= n; ++i)
        for(int j = 1; j + (1 << i) - 1 <= n; ++j)
            t[i][j] = min(t[i - 1][j], t[i - 1][j + (1 << (i - 1))]);
}

void query()
{
    int x, y, k;
    fin >> x >> y;
    k = lg2[y - x + 1];
    fout << min(t[k][x], t[k][y - (1 << k) + 1]) << '\n';
}

int main()
{
    fin >> n >> m;
    lg2[0] = -1; ///(*)
    for(int i = 1; i <= n; ++i)
    {
        fin >> t[0][i];
        lg2[i] = lg2[i >> 1] + 1;
    }
    lg2[0] = 0;
    genRMQ();
    while(m--) query();
    return 0;
}