#include <stdio.h>
#include <algorithm>
#define NMAX 100005
#define LMAX 20

using namespace std;

FILE* fin = fopen("rmq.in", "r");
FILE* fout = fopen("rmq.out", "w");

int n, m, p, q, lg[LMAX], a[NMAX], rmq[NMAX][LMAX];

int main() {
    fscanf(fin, "%d%d", &n, &m);
    lg[1] = 0;

    for (int i = 2; i <= n; ++i)
        lg[i] = lg[i / 2] + 1;

    for (int i = 1; i <= n; ++i)
        fscanf(fin, "%d", &rmq[i][0]);

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

    for (int i = 1; i <= m; ++i) {
            fscanf(fin, "%d%d", &p, &q);
            fprintf(fout, "%d\n", min(rmq[p][lg[q - p + 1]], rmq[q - (1 << lg[q - p + 1]) + 1][lg[q - p + 1]]));
        }

    return 0;
}