#include <fstream>
#include <cmath>
using namespace std;

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

const int nMax = 1e5;
const int lognMax = 17;

int table[nMax][lognMax];

void buildSparseTable(int n) {
    for (int j = 1; (1 << j) <= n; j++) {
        for (int i = 0; i + (1 << j) <= n; i++) {
            table[i][j] = min(table[i][j - 1], table[i + (1 << (j - 1))][j - 1]);
        }
    }
}

int query(int left, int right) {
    int k = static_cast<int>(log2(right - left + 1));
    return min(table[left][k], table[right - (1 << k) + 1][k]);
}

int main() {
    ios::sync_with_stdio(false);

    int n, m;
    fin >> n >> m;
    for (int i = 0; i < n; i++) {
        fin >> table[i][0];
    }
    buildSparseTable(n);
    for (int i = 0; i < m; i++) {
        int left, right;
        fin >> left >> right;
        fout << query(left - 1, right - 1) << "\n";
    }

    return 0;
}