/*



*/

#include <fstream>
#include <cmath>

const int NMAX=1e5+8;

int n,m;
int rmq[20][NMAX];
int lg[NMAX];

int query(int st,int dr) {
    int l=lg[dr-st+1];
    int sh=dr-st+1-(1<<l);
    return std::min(rmq[l][st],rmq[l][st+sh]);
}

int main() {
    std::ifstream fin("rmq.in");
    std::ofstream fout("rmq.out");

    std::ios_base::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr);

    fin >> n >> m;
    for(int i=1; i<=n; i++) {
        fin >> rmq[0][i];
        if(i>1) {
            lg[i]=lg[i/2]+1;
        }
    }

    for(int i=1; (1<<i)<=n; i++) {
        for(int j=1; j<=n-(1<<i)+1; j++) {
            int l(1<<(i-1));
            rmq[i][j]=std::min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    }

    for(int i=1; i<=m; i++) {
        int st,dr;
        fin >> st >> dr;
        fout << query(st,dr) << '\n';
    }

    return 0;
}