#include <fstream>
using namespace std;

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

const int N = 1e5 + 5, logN = 18;

int n, m, rmq[logN][N], x, y, bp[N];

const int oo = 1e9;

int main() {
    fin >> n >> m;
    for (int i = 2; i <= n; ++i)
        bp[i] = bp[i >> 1] + 1;
    for (int i = 1; i <= n; ++i)
        fin >> rmq[0][i];
    for (int p = 1; (1 << p) <= n; ++p)
        for (int i = 1; i + (1 << p) <= n + 1; ++i)
            rmq[p][i] = min(rmq[p-1][i], rmq[p-1][i + (1 << (p - 1))]);

    while (m--) {
        fin >> x >> y;
        int p = bp[y - x + 1], dif = y - x + 1 - (1 << p);
        fout << min(rmq[p][x], rmq[p][x + dif]) << "\n";
    }
}