#include <bits/stdc++.h>

using namespace std;

int b[100005][25],a[100005],n,m,l,r;

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

    for(int i=1;i<=n;i++) b[i][0]=a[i];

    for(int j=1;(1<<j)<=n;j++){
        for(int i=1;i<=n;i++){
            b[i][j]=min(b[i][j-1],b[i+(1<<(j-1))][j-1]);
        }
    }

    for(int i=1;i<=m;i++){
        in >> l >> r;
        int k = (int)log2(r-l+1);
        out << min(b[l][k],b[r-(1<<k)+1][k]) << '\n';
    }
}