#include <bits/stdc++.h>
#define NMAX 100005
#define MMAX 20

//in-out
std::ifstream f("rmq.in");
std::ofstream g("rmq.out");

//data
std::vector<int>v(NMAX);
std::vector<int>lg(NMAX);
int n, q;
int RMQ[NMAX][MMAX];

//readData
void readData(){
    f >> n >> q;
    for(int i = 0; i<n; i++){
        f >> v[i];
    }
}

inline int MIN(int A, int B){
    if(A <= B){
        return A;
    }
    return B;
}

void precalc(){
    for(int i = 2; i<=n; i++){
        lg[i] = lg[i/2] + 1;
    }
    int lgN = lg[n] + 1;
    for(int i = 0; i<n; i++){
        RMQ[i][0] = v[i];
    }
    for(int j = 1; j<lgN; j++){
        for(int i = 0; i<n - (1 << j) + 1; i++){    
            RMQ[i][j] = MIN(RMQ[i][j - 1], RMQ[i + (1 << (j - 1))][j - 1]);
        }
    }
}   

int query(int x, int y){
    x --; y --;
    int l = y - x + 1;
    int K = lg[l];
    int firstNum = RMQ[x][K];
    int R = y - (1 << K) + 1;
    int secondNum = RMQ[R][K];
    return MIN(firstNum, secondNum);
}

//solve
void solve(){
    precalc();
    int x, y;
    while(q){
        f >> x >> y;
        g << query(x, y) << '\n';
        q --;
    }
}

int main(){
    readData();
    solve();
    return 0;
}