#include <bits/stdc++.h>
#define MAX 131072

using namespace std;
const int NMAX = 100010;
FILE *IN;

int N, M;
int v[NMAX], Log[NMAX];
int R[NMAX][18];

int sign, pos;
char f[MAX];

inline void Read(int &nr){
    sign = 0;
    nr = 0;
    while(f[pos] < '0' || f[pos] > '9'){
        if(f[pos] == '-') sign=1;
        pos++;
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    while(f[pos] >= '0' && f[pos] <= '9'){
        nr = 10 * nr + f[pos++] - '0';
        if(pos == MAX)
            fread(f, MAX, 1, IN), pos = 0;
    }
    if(sign) nr =- nr;
}

int read(){
    Read(N); Read(M);
    for(int i = 0; i < N; i++) Read(v[i]);
}

int main(){

    IN = fopen("rmq.in", "r");
    freopen("rmq.out", "w", stdout);

    read();
    Log[1] = 0; Log[2] = 1;
    int cnt = 4;
    for(int i = 3; i <= N; i++){
        if(i == cnt) Log[i] = Log[i - 1] + 1, cnt *= 2;
        else Log[i] = Log[i - 1];
    }
    for(int i = 0; i < N; i++)
        R[i][0] = v[i];

    int posj = 1;
    for(int j = 1; j <= Log[N]; j++){
        for(int i = 0; i < N; i++){
            if(i + posj < N)
                R[i][j] = min(R[i][j - 1], R[i + posj][j - 1]);
            else R[i][j] = R[i][j - 1];
        }
        posj *= 2;
    }

    int x, y, ans;
    for(int i = 1; i <= M; i++){
        Read(x); Read(y); x--; y--;
        ans = min(R[y - (1 << Log[y - x]) + 1][Log[y - x]], R[x][Log[y - x]]);
        printf("%d\n", ans);
    }

    return 0;
}