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

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

struct aib{

    vector<int> tree;

    void update(int pos, int node, int left, int right, int value) {
        if (left == right) {
            tree[node] = value;
            return;
        }
        int mij = (left + right) / 2;
        if (pos <= mij) {
            update(pos, 2 * node, left, mij, value);
        } else {
            update(pos, 2 * node + 1, mij + 1, right, value);
        }
        tree[node] = min(tree[2 * node], tree[2 * node + 1]);
    }

    void query(int node, int req_left, int req_right, int left, int right, int &minim) {
        if (req_left <= left && right <= req_right) {
            minim = min(minim, tree[node]);
            return;
        }
        int mij = (left + right) / 2;
        if (req_left <= mij) {
            query(2 * node, req_left, req_right, left, mij, minim);
        }
        if (req_right > mij) {
            query(2 * node + 1, req_left, req_right, mij + 1, right, minim);
        }
    }
};

int main() {
    ios::sync_with_stdio(false), fin.tie(nullptr);
    int N, M, biggest_power; fin >> N >> M; 
    for (biggest_power = 0; (1 << biggest_power) < 2 * N - 1; ++ biggest_power);
    aib arbore_intervale;
    arbore_intervale.tree.resize((1 << biggest_power)); fill(arbore_intervale.tree.begin(), arbore_intervale.tree.end(), INT_MAX);
    for (int i = 0; i < N; ++i) {
        int x; fin >> x;
        arbore_intervale.update(i, 1, 0, N - 1, x);
    }
    while (M--) {
        int x, y; fin >> x >> y; --x, --y;
        int minim = INT_MAX;
        arbore_intervale.query(1, x, y, 0, N - 1, minim);
        fout << minim << '\n';
    }
    return 0;
}