#include<bits/stdc++.h>
#define N 100005
using namespace std;

int rmq[N][18];
int LOG[N];
int n,m,a,b;

int main() {
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin>>n>>m;
    for (int i=1; i<=n; ++i) cin>>rmq[i][0];

    for (int i=2; i<=N-5; ++i) LOG[i]=LOG[i>>1]+1;
    for (int j=1; (1<<j)<=n; ++j) {
        for (int i=1; i+(1<<j)-1<=n; ++i) rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
    }

    while (m--) {
        cin>>a>>b;
        int l=b-a+1;
        int k=LOG[l];
        cout<<min(rmq[a][k], rmq[b-(1<<k)+1][k])<<'\n';
    }


    return 0;
}