#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
const int NMAX = 1e5;
int a[NMAX + 1],n;
int rmq[NMAX + 1][20];
int LOG[NMAX + 1];
void preproc_rmq(){

    for(int i = 0; i < n; i++) {
        rmq[i][0] = a[i];
    }

    for(int j=1; (1 << j) <= n; j++)
        for(int i=0;i+(1 << j)-1<n;i++)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);

}

int query(int x,int y){

    int k = log2(y - x + 1);
    return min(rmq[x][k], rmq[y - (1 << k) + 1][k]);
}
int main(){
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    int m,x,y;
    f>>n>>m;
    for(int i=0;i<n;i++)
        f>>a[i];

    preproc_rmq();



    for(int i=0;i<m;i++){
        f>>x>>y;
        g<<query(x-1,y-1)<<endl;
    }
    f.close();
    g.close();
}