#include <bits/stdc++.h>

using namespace std;

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

const int NM = 1e5 + 5;

int rmq[NM][20];
int k[NM], n, m;

int main () {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x; fin >> x;
        rmq[i][0] = x;
    }
    for (int i = 2; i < NM; i++) {
        k[i] = k[i / 2] + 1;
    }
    for (int j = 1; j < 20; ++j) {
        for (int i = 1; i + (1 << j) - 1 <= n; i++) {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
    }
    while (m--) {
        int l, r; fin >> l >> r;
        int w = k[r - l + 1];
        fout << min(rmq[l][w], rmq[r - (1 << w) + 1][w]) << '\n';
    }
}