#include <fstream>
#include <algorithm>
#include <cmath>

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

int const nmax = 100005;
int const lgnmax = 20;
int v[nmax];
int rmq[nmax][lgnmax];

void solve_rmq (int n) {
    int lg = log2(n);
    for (int p = 1; p <= lg; p++)
        for (int i = 1; i <= n - (1 << p) + 1; i++)
            rmq[i][p] = std::min(rmq[i][p - 1], rmq[i + (1 << (p - 1))][p - 1]);
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
        rmq[i][0] = v[i];
    }
    solve_rmq(n);
    while (m--) {
        int x, y;
        fin >> x >> y;
        int put = log2(y - x + 1);
        fout << std::min(rmq[x][put], rmq[y - (1 << put) + 1][put]) << "\n";
    }
    return 0;
}