#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100000;
const int LOG = 17;  // log2(100000) ≈ 16.6

int sp[MAXN][LOG];  
int lg[MAXN + 1];  

void buildSparseTable(vector<int> &arr, int n) {
    for (int i = 0; i < n; i++)
        sp[i][0] = arr[i];

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

int query(int l, int r) {
    int k = lg[r - l + 1];
    return min(sp[l][k], sp[r - (1 << k) + 1][k]);
}

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

    int N, M;
    fin >> N >> M;

    vector<int> arr(N);
    for (int i = 0; i < N; i++)
        fin >> arr[i];

    lg[1] = 0;
    for (int i = 2; i <= N; i++)
        lg[i] = lg[i / 2] + 1;

    buildSparseTable(arr, N);

    while (M--) {
        int x, y;
        fin >> x >> y;
        fout << query(x - 1, y - 1) << '\n';  
    }

    fin.close();
    fout.close();
    return 0;
}