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

int n,m,x,y;
int rmq[18][100005];
void solve() {
    for(int i=1;(1<<i)<=n;i++) {
        int pw=(1<<i);
        for(int j=1;j+pw-1<=n;j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+pw/2]);
    }
}
int query(int x,int y) {
    for(int i=17;i>=0;i--)
        if(y-x+1>=(1<<i))
            return min(rmq[i][x],rmq[i][y-(1<<i)+1]);
}
int main() {

    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin>>n>>m;
    for(int i=1;i<=n;i++) {
        fin>>x;
        rmq[0][i]=x;
    }
    solve();
    while(m--) {
        fin>>x>>y;
        fout<<query(x,y)<<"\n";
    }
    return 0;
}