#include<cstdio>
#include<cctype>
#define MAX_N 100000
#define MAX_LOG 17
#define BUF_SIZE 1 << 19
using namespace std;

int sparse[MAX_N][MAX_LOG+1], v[MAX_N], n, m, pos = BUF_SIZE;
char buf[BUF_SIZE];

inline char getChar(FILE* fin) {
    if(pos == BUF_SIZE) {
        fread(buf,1,BUF_SIZE,fin);
        pos = 0;
    }
    return buf[pos++];
}

inline int read(FILE* fin) {
    int res = 0;
    char c;
    do {
        c = getChar(fin);
    }while(!isdigit(c));
    do {
        res = 10*res + c - '0';
        c = getChar(fin);
    }while(isdigit(c));
    return res;
}

inline int log2(int x) {
    return 31 - __builtin_clz(x);
}

void preprocess(int n) {
    int i, j;
    for(i = 0; i < n; i++)
        sparse[i][0] = i;
    for(j = 1; (1 << j) <= n; j++)
        for(i = 0; i + (1 << j) - 1 < n; i++)
            if(v[sparse[i][j-1]] < v[sparse[i + (1 <<(j-1))][j-1]])
                sparse[i][j] = sparse[i][j-1];
            else sparse[i][j] = sparse[i + (1 <<(j-1))][j-1];
}

inline int RMQ(int low, int high) {
    int l = high - low + 1;
    int k = log2(l);
    if(v[sparse[low][k]] < v[sparse[low + l - (1<<k)][k]])
        return v[sparse[low][k]];
    else return v[sparse[low + l - (1<<k)][k]];
}

int main() {
    int i, x, y;
    FILE* fin, *fout;
    fin = fopen("rmq.in","r");
    fout = fopen("rmq.out","w");
    n = read(fin); m = read(fin);
    for(i = 0; i < n; i++)
        v[i] = read(fin);
    preprocess(n);
    for(i = 0; i < m; i++) {
        x = read(fin); y = read(fin);
        fprintf(fout,"%d\n",RMQ(x-1,y-1));
    }
    fclose(fin);
    fclose(fout);
    return 0;
}