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

const int N_MAX = 100000;
const int LOGN_MAX = 20;

int n, m;
int rmq[N_MAX][LOGN_MAX];

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

int queryRMQ(int a, int b) {
    int k = int(log2(b - a + 1));

    return min(rmq[a][k], rmq[b - (1 << k) + 1][k]);
}

void read() {
    assert(freopen("rmq.in", "r", stdin));
    assert(freopen("rmq.out", "w", stdout));

    assert(scanf("%d%d", &n, &m));
    for(int i = 0; i < n; ++i) {
        assert(scanf("%d", &rmq[i][0]));
    }

}

int main() {
    read();

    buildRMQ();

    int x, y;
    while(m--) {
        assert(scanf("%d%d", &x, &y));
        printf("%d\n", queryRMQ(x - 1, y - 1));
    }
}