#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, q, x, y, i;
int rmq[20][100002], lg[100002];

static inline void Rmq() {
    for(int i = 2; i <= n; i++) lg[i] = lg[(i >> 1)] + 1;

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

static inline int query(int x, int y) {
    int l = lg[y - x];
    return min(rmq[l][x], rmq[l][y - (1 << l) + 1]);
}

int main() {
    fin >> n >> q;
    for(i = 1; i <= n; i++) fin >> rmq[0][i];
    Rmq();
    while(q--) {
        fin >> x >> y;
        fout << query(x, y) << "\n";
    }

    return 0;
}