#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;

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

const int MAX_N = 100000;
const int MAX_M = 1000000;
const int MAX_NUM = 100000;

int arr[MAX_N];
int matrice[MAX_N][20];

void construieste(int n) {
    for (int i = 0; i < n; i++) {
        matrice[i][0] = arr[i];
    }

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

int returnMin(int stanga, int dreapta) {
    int k = log2(dreapta - stanga + 1);
    return min(matrice[stanga][k], matrice[dreapta - (1 << k) + 1][k]);
}

int main() {
    int N, M;
    f >> N >> M;

    for (int i = 0; i < N; i++) {
        f >> arr[i];
    }

    construieste(N);

    while (M--) {
        int x, y;
        f >> x >> y;
        int rezultat = returnMin(x - 1, y - 1);
        g << rezultat << endl;
    }

    return 0;
}