#include <cstdio>
#include <vector>
#include<cmath>
using namespace std;

const int NMAX = 100005;
const int LOG_MAX = 17;

int rmq[NMAX][LOG_MAX];

void build(const vector<int> a) {
    for (int i = 0; i < a.size(); i++) {
        rmq[i][0] = a[i];
    }

    for (int j = 1; j < LOG_MAX; j++) {
        for (int i = 0; i + (1 << j) <= a.size(); i++) {
            rmq[i][j] = min(rmq[i][j-1], rmq[i + (1 << (j-1))][j-1]);
        }
    }
}
int query(int l, int r) {
    r--;
    l--;

    int log_query = log2(r - l + 1);
    int left_child = rmq[l][log_query];
    int right_child = rmq[r - (1<<log_query) + 1][log_query];
    return min(left_child, right_child);
}

int main() {
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    int n, m;
    vector<int> v;

    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i++) {
        int c;
        scanf("%d", &c);
        v.push_back(c);
    }
    build(v);
    for (int i = 0; i < m; i++) {
        int left, right;
        scanf("%d%d", &left, &right);
        printf("%d\n", query(left, right));
    }

    return 0;
}