#include <bits/stdc++.h>
using namespace std;
const int LMAX = 18;
const int NMAX = 1e5+2;
int n,m,rmq[LMAX][NMAX];

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

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> rmq[0][i];
    }
    for(int j = 1; j < LMAX; j++){
        for(int i = 1; i <= n; i++){
            rmq[j][i] = rmq[j-1][i];
            if(i+(1<<(j-1)) <= n){
                rmq[j][i] = min(rmq[j][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(m--){
        int l, r;
        fin >> l >> r;
        fout << query(l, r) << "\n";
    }
    return 0;
}