#include <stdio.h>

#define NMAX 100001
#define LMAX 18
#define min(a, b) ((a) < (b) ? (a) : (b))

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

int main()
{
    FILE *fin = fopen("rmq.in", "r");
    FILE *fout = fopen("rmq.out", "q");

    int i, j, l;
    fscanf(fin, "%d%d", &n, &m);

    for (i = 1; i <= n; i++) {
        fscanf(fin, "%d", &a[i]);
    }

    lg[1] = 0;
    for (i = 2; i <= n; i++) {
        lg[i] = lg[i >> 1] + 1;
    }

    for (i = 1; i <= n; i++) {
        rmq[0][i] = a[i];
    }

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

    long int x,y,diff,t;

    for (i = 1; i <= m; i++) {
        fscanf(fin, "%d%d", &x, &y);
        diff = y - x + 1;
        l = lg[diff];
        t = diff - (1 << l);
        fprintf(fout, "%d\n", min(rmq[l][x], rmq[l][x + t]));
    }
    return 0;
}