#include<bits/stdc++.h>
#define N 100030

using namespace std;

int n,m;
int LOG[N], rmq[N][20], a[N];

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

    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--) {
        int a,b; 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;
}