#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

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

long long rmq[18][100001], a[100001], lg[10001];

int main() {
    long long i, j, l, n, m, x, y;
    fin >> n >> m;
    for (i = 1; i <= n; ++i) {
        fin >> a[i];
    }
    lg[1] = 0;
    for (i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (i = 1; i <= n; ++i)
        rmq[0][i] = a[i];
    for (i = 1; (1 << i) <= n; ++i)
        for (j = 1; j <= n - (1 << i) + 1; ++j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    for (i = 0; i < m; ++i) {
        fin >> x >> y;
        int d = y - x + 1;
        int l = lg[d];
        d -= (1 << l);
        fout << min(rmq[l][x], rmq[l][x + d]) << "\n";
    }
    return 0;
}