#include <bits/stdc++.h>

using namespace std;

//rmq[i][j] = minimul pe intervalul care incepe la pozitia i
//si are lungime 2^j
//rmq[i][0] = v[i]
//rmq[i][1] = min(v[i], v[i + 1])
//rmq[i][2] = min(v[i], v[i + 1], v[i + 2], v[i + 3])
//          = min(rmq[i][1], rmq[i + 2][1])
//rmq[i][j] = min(rmq[i][j - 1], rmq[i + 2 ^ (j - 1)][j - 1])


//[i, i + 2 ^ j - 1] = [i, i + 2 ^ (j - 1) - 1] U [i + 2 ^ (j - 1), i + 2 ^ j - 1]

const int NMAX = 1e5;
const int PMAX = 17;

int rmq[NMAX + 1][PMAX + 1];
int v[NMAX + 1], Log[NMAX + 1];

int query_1(int x, int y) {
    int len = y - x + 1;
    int p = Log[len];
    int lg = (1 << p);
    return min(rmq[x][p], rmq[y - lg + 1][p]);
}


int query_log(int x, int y) {
    int len = y - x + 1;
    int ans = 1e9;
    for(int i = 0; (1 << i) <= len; i++) {
        if(len & (1 << i)) {
            ans = min(ans, rmq[x][i]);
            x = x + (1 << i);
        }
    }
    return ans;
}

int main() {
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    int n, q;
    f >> n >> q;
    for(int i = 1; i <= n; i++) {
        f >> v[i];
    }
    for(int i = 1; i <= n; i++) {
        rmq[i][0] = v[i];
    }
    Log[1] = 0;
    for(int i = 1; i <= n; i++) {
        Log[i] = Log[i / 2] + 1;//log(i / 2) = log(i) - log(2) = log(i) - 1
    }
    for(int j = 1; j <= Log[n]; j++) {
        for(int i = 1; i <= n - (1 << j) + 1; i++) {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
    }
    for(int i = 1; i <= q; i++) {
        int x, y;
        f >> x >> y;
        g << query_1(x, y) << '\n';
        //g << query_log(x, y) << '\n';
    }
    return 0;
}