#include <bits/stdc++.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m, v[100001], lookup[100001][21];

struct Query{
    int L, R;
} q[1000001];

void preprocess(int v[], int n){
    for(int i = 0; i < n; i++)
        lookup[i][0] = i;

    for(int j = 1; (1 << j) <= n; j++){
        for(int i = 0; (i + (1 << j) - 1) < n; i++){

            if(v[lookup[i][j - 1]] < v[lookup[i + (1 << (j - 1))][j - 1]])
                lookup[i][j] = lookup[i][j - 1];
            else
                lookup[i][j] = lookup[i + (1 << (j - 1))][j - 1];

        }
    }
}

int query(int v[], int L, int R){

    int j = (int) log2(R - L + 1);

    return min(v[lookup[L][j]], v[lookup[R - (1 << j) + 1][j]]);

}

void RMQ(int v[], int n, Query q[], int m){
    preprocess(v, n);

    for(int i = 0; i < m; i++){
        int L = q[i].L, R = q[i].R;
        
        fout << query(v, L, R) << '\n';
    }
}

int main(){
    fin >> n >> m;
    
    int i, x, y;

    for(i = 0; i < n; i++)
        fin >> v[i];

    for(i = 0; i < m; i++){
        fin >> x >> y;
        q[i].L = x - 1, q[i].R = y - 1;
    }
    
    RMQ(v, n, q, m);
}