#include <iostream>
#include <fstream>

using namespace std;

ifstream f ("rmq.in");
ofstream g ("rmq.out");

const int NMAX = 100000 + 1;
const int LOGMAX = 18;

int n, m;

int logaritm[NMAX];

int rmq[LOGMAX][NMAX];

void citeste() {
    f >> n >> m;
    for (int i = 1; i <= n; i++)
        f >> rmq[0][i];
}


void initializeaza() {
    for (int i = 2; i <= n; i++)
        logaritm[i] = logaritm[i / 2] + 1;

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

int get_minim(int a, int b) {
    int lg = logaritm[b - a + 1];
    return min(rmq[lg][a], rmq[lg][b - (1 << lg) + 1]);
}

void rezolva() {
    initializeaza();
    int a, b;
    for (int i = 1; i <= m; i++) {
        f >> a >> b;
        g << get_minim(a, b) << '\n';
    }
}

int main() {
    citeste();
    rezolva();
    return 0;
}