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

int rmq[100001][20];


int interogare(int a, int b)
{
    int lung=b-a+1, k=(int)(log2(lung));
    return min(rmq[a][k], rmq[b-(1<<k)+1][k]);
}
int main(){
    int n, m;
    fin>>n>>m;
    int l=log2(n);

    for(int i=0; i<n; i++){
        int x;
        fin>>x;
        rmq[i][0]=x;
    }
    for(int j=1; j<=l; j++){
        for(int i=0; i<n; i++){
            if(i+(1<<(j))<=n)
                rmq[i][j]=min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
        }
    }
    for(int i=0; i<m; i++){
        int a, b;
        fin>>a>>b;
        a--; b--;
        fout<<interogare(a, b)<<'\n';
    }
    return 0;
}