#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int rmq[100000][20];

int interogare(int x, int y){
    int v=(int)(log2(y-x+1));
    return min(rmq[x][v], rmq[y-(1<<v)+1][v]);
}

int main(){
    int n, m, x, y; 
    fin>>n>>m;
    for(int i=0; i<n; i++){
        fin>>rmq[i][0];
    }   

    int l=log2(n);
    for(int j=1; j<=l; j++){
        for(int i=0; i<n; i++){
            if(n>=(i+(1<<j)))
                rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
        }
    }

    for(int i=0; i<m; i++){
        fin>>x>>y;
        // x,y>=1, dar am facut indexarea de la 0!!!
        x--; y--;
        fout<<interogare(x, y)<<'\n';
    }
    return 0;
}