#include <bits/stdc++.h>
#define MAXN 1000000
#define MAX_LOG 17

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int v[MAXN + 1], r[MAX_LOG][MAXN + 1], log_2[MAXN + 1];

int main() {
    int n, m, i, j, st, dr, len, p;

    fin >> n >> m;
    for (i = 1; i <= n; i++) {
        fin >> v[i];
    }
    log_2[1] = 0;
    for (i = 2; i <= n; i++) {
        log_2[i] = 1 + log_2[i / 2];
       // printf("i  =%d, log2  = %d\n", i, log_2[i]);
    }
    for (i = 0; i <= log_2[n]; i++) {
        for (j = 1; j <= n; j++) {
            if (i == 0) {
                r[i][j] = v[j];
            }else if ((1 << i - 1) <= j){
                r[i][j] = min(r[i - 1][j - (1 << (i - 1))], r[i - 1][j]);
            }
           // printf("i = %d, j = %d, r = %d\n", (1 << i), j, r[i][j]);
        }
    }

    printf("\n");
    for (i = 1; i <= m; i++) {
        fin >> st >> dr;
        len = dr - st + 1;
        fout << min(r[log_2[len]][dr], r[log_2[len]][st + (1 << log_2[len]) - 1]) << "\n";
       // printf("st = %d, dr = %d log_2[%d] = %d, r1 = %d, r2 = %d\n", st, dr, len, log_2[len], r[log_2[len]][dr], r[log_2[len]][st + (1 << log_2[len]) - 1]);
    }
    return 0;
}