#include<iostream>
#include<fstream>
//#include<conio.h>
#include<algorithm>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define MN 100001
#define logM 17
 
int n, m, rmq[MN][logM];
int Log2[MN];
int main(){
    int i, j, x, y, L;
    fin>>n>>m;
 
    for(i=1; i<=n; ++i)
        fin>>rmq[i][0];
	for(i=2;i<=n; ++i)
		Log2[i] = 1+Log2[i/2];
    //precalc
    for(j=1; (1<<j)<=n; ++j) //puterea
        for(i=1; i<=n-(1<<j)+1; ++i){
            L=1<<(j-1);
            rmq[i][j]=min(rmq[i][j-1], rmq[i+L][j-1]);
        }
 
    while(m--){
        fin>>x>>y;
        L=y-x+1;
        j=Log2[L];
        fout<<min(rmq[x][j], rmq[y-(1<<j)+1][j])<<"\n";
    }
 
    //getch();
    return 0;
}