#include <cstdio>
#include <algorithm>
using namespace std;
#define NMAX 100005
#define LOGMAX 25
#define pwr(x) (1 << x)
int n, m, a[NMAX], sparce[NMAX][LOGMAX], LOGA[NMAX];

int main(){
    int i, j, low, high, l, k;
    FILE *fin, *fout;
    fin = fopen("rmq.in", "r");
    fout = fopen("rmq.out", "w");

    fscanf(fin, "%d %d", &n, &m);
    for(i=0; i<n; i++)
        fscanf(fin, "%d ", &a[i]);

    //Sparce
    for(i=2; i<=n; i++)
        LOGA[i] = LOGA[i/2] + 1;
    for(i=0; i<n; i++)
        sparce[i][0] = i;
    for(j=1; pwr(j) <= n; j++){
        for(i=0; i + pwr(j) - 1 < n; i++){
            if(a[ sparce[i][j-1] ] < a[ sparce[i + pwr(j-1)][j-1] ])
                sparce[i][j] = sparce[i][j-1];
            else sparce[i][j] = sparce[i + pwr(j-1)][j-1];
        }
    }

    for(i=1; i<=m; i++){
        fscanf(fin, "%d %d", &low, &high);
        low--;
        high--;
        l = high - low + 1;
        k = LOGA[l];
        fprintf(fout, "%d\n", min( a[ sparce[low][k] ], a[ sparce[low + l - pwr(k)][k] ]));
    }

    return 0;
}