#include <bits/stdc++.h>

using namespace std;

const int NMAX = 1e5 + 10;
const int LOG_MAX = 17;

int v[NMAX], rmq[NMAX][LOG_MAX];

void compute_range_minimum_query(int n){
    for(int i = 0; i < n; i++){
        rmq[i][0] = v[i];
    }
    for(int j = 1; j <= LOG_MAX; j++){
        for(int i = 0; i + (1 << j) <= n; 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 log_query = log2(y - x + 1);
    int left_son = rmq[x][log_query];
    int right_son = rmq[y - (1<<log_query) + 1][log_query];
    return min(left_son, right_son);
}

int main(){
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);


    int n, m;
    scanf("%d %d", &n, &m);

    for(int i = 0; i < n; i++)
        scanf("%d", &v[i]);

    compute_range_minimum_query(n);
    for(; m > 0; m--){
        int left, right;
        scanf("%d %d", &left, &right);
        printf("%d\n", query(left, right));
    }
    return 0;
}