#include <bits/stdc++.h>
#pragma GCC taget("avx2")
using namespace std;
const int NMAX = 1e5+2;
const int LMAX = 18;
int n,q,v[NMAX],rmq[LMAX][NMAX];

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

int main() {
    fin >> n >> q;
    for(int i = 1; i <= n; i++){
        fin >> v[i];
        rmq[0][i] = v[i];
    }
    for(int j = 1; j < LMAX; j++){
        for(int i = 1; i+(1<<(j-1)) <= n; i++){
            rmq[j][i] = min(rmq[j-1][i], rmq[j-1][i+(1<<(j-1))]);
        }
    }
    auto query = [&](int l, int r) -> int{
        int len = (r-l+1);
        int lg = __lg(len);
        return min(rmq[lg][l], rmq[lg][r-(1<<lg)+1]);
    };
    while(q--){
        int l,r;
        fin >> l >> r;
        fout << query(l, r) << "\n";
    }
    return 0;
}