#include<fstream>
#include<algorithm>
using namespace std;

const int NMAX=100005;
int v[20][NMAX],logv[NMAX];

int main(){
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>v[0][i];
    for(int p=2,i=1;p<=n;p*=2,i++)
        for(int j=1;j+p-1<=n;j++)
            v[i][j]=min(v[i-1][j], v[i-1][j+p/2]);
    for(int i=2,j=2;i<=NMAX-5;i++){
        if(j==i){
            logv[i]=logv[i-1]+1;
            j*=2;
        }
        else
            logv[i]=logv[i-1];
    }
    for(int i=1;i<=m;i++){
        ///query
        int x,y,log;
        fin>>x>>y;
        log=logv[y-x];
        fout<<min(v[log][x], v[log][y-(1<<log)+1])<<'\n';
    }
    return 0;
}