#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>

using namespace std;

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

int N, M;
vector<int> Elemente;
vector<vector<int>> SparseTable;

void ConstruiesteSparseTable() {
    int K = log2(N) + 1;
    SparseTable.resize(N, vector<int>(K));

    for (int i = 0; i < N; i++)
        SparseTable[i][0] = Elemente[i];

    for (int j = 1; (1 << j) <= N; j++) {
        for (int i = 0; i + (1 << j) <= N; i++) {
            SparseTable[i][j] = min(SparseTable[i][j - 1], SparseTable[i + (1 << (j - 1))][j - 1]);
        }
    }
}

int Interogare(int st, int dr) {
    int K = log2(dr - st + 1);
    return min(SparseTable[st][K], SparseTable[dr - (1 << K) + 1][K]);
}

int main() {
    fin >> N >> M;

    Elemente.resize(N);
    for (int i = 0; i < N; i++)
        fin >> Elemente[i];

    ConstruiesteSparseTable();

    for (int i = 0; i < M; i++) {
        int x, y;
        fin >> x >> y;

        int rezultat = Interogare(x - 1, y - 1);
        fout << rezultat << endl;
    }

    return 0;
}