#include <bits/stdc++.h>
#define zeros(x)  (x & (-x))
using namespace std;
const int MAXN =  15 + 1e5;
const int LOGMAX = 25;
int a[MAXN];
int maxim[MAXN][LOGMAX];
void propagare(int n){
    for(int j = 1; ( 1 << j ) < n; ++j){
        for(int i = 0; i + ( 1 << j ) <= n; ++i){
            if(a[maxim[i][j - 1]] < a[maxim[i + ( 1 << (j - 1))][j - 1]])
                maxim[i][j] = maxim[i][j - 1];
            else maxim[i][j] = maxim[i + ( 1 << (j - 1))][j - 1];
        }
    }
}
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main(){
    int n, m;
    fin >> n >> m;
    for(int i = 0; i < n; ++i){
        fin >> a[i];
        maxim[i][0] = i;
    }
    propagare(n);
    for(int i = 1; i <= m; ++i){
        int x, y, log = 0, dif;
        fin >> x >> y;
        x--;
        y--;
        dif = y - x + 1;
        while(dif > 1) dif /= 2, log++;
        fout << min(a[maxim[x][log]] , a[maxim[y - (1 << log) + 1][log]]) << '\n';
    }
    return 0;
}