#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 1e5, LMAX = 17;

int n, m, v[NMAX + 5], rmq[LMAX + 5][NMAX + 5], lg2[NMAX + 5];

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    lg2[1] = 0;
    for (int i = 2; i <= n; i++)
        lg2[i] = lg2[i / 2] + 1;
    for (int i = 1; i <= n; i++)
        rmq[0][i] = v[i];
    for (int i = 1; i <= lg2[n]; i++) {
        for (int j = 1; j + (1 << i) - 1 <= n; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    }
    while (m--) {
        int l, r;
        fin >> l >> r;
        int k = lg2[r - l + 1];
        fout << min(rmq[k][l], rmq[k][r - (1 << k) + 1]) << "\n";
    }
    return 0;
}