#include <stdio.h>
#include <algorithm>
using namespace std;

const int NMAX = 1e5, LOGMAX = 16;

int v[NMAX], rmq[NMAX][LOGMAX + 1], logg[NMAX + 1];

int main() {
    int n, m, i, l, r, p, log2;
    FILE *fin, *fout;

    fin = fopen("rmq.in", "r");
    fscanf(fin, "%d%d", &n, &m);
    for(i = 0; i < n; i++)
        fscanf(fin, "%d", &v[i]);

    for(i = 0; i < n; i++)
        rmq[i][0] = v[i];
    for(p = 1; p <= LOGMAX; p++)
        for(i = 0; i + (1 << p) - 1 < n; i++)
            rmq[i][p] = min(rmq[i][p - 1], rmq[i + (1 << (p - 1))][p - 1]);
    logg[1] = 0;
    for(i = 2; i <= n; i++)
        logg[i] = logg[i / 2] + 1;
    
    fout = fopen("rmq.out", "w");
    for(i = 0; i < m; i++) {
        fscanf(fin, "%d%d", &l, &r);
        l--;
        r--;
        log2 = logg[r - l + 1];
        fprintf(fout, "%d\n", min(rmq[l][log2], rmq[r - (1 << log2) + 1][log2]));
    }

    fclose(fin);
    fclose(fout);
    return 0;
}