#include <fstream>
#include <cmath>

using namespace std;

const int NMAX=100005;

ifstream cin ("rmq.in");
ofstream cout ("rmq.out");

int v[NMAX];
int d[NMAX][20];
int p2[25];
void build_pow()
{
    p2[0]=1;
    for(int i=1; i<=20; ++i)
        p2[i]=p2[i-1]<<1;
}
int main()
{
    build_pow();
    int n,m;
    cin>>n>>m;
    for(int i=1; i<=n; ++i) {
        cin>>v[i];
        d[i][0]=v[i];
    }
    for(int i=n; i>=1; --i) {
        for(int j=1; i+p2[j-1]-1<=n; ++j)
            d[i][j]=min(d[i][j-1],d[i+p2[j-1]][j-1]);
    }
    for(int i=1; i<=m; ++i) {
        int a,b;
        cin>>a>>b;
        int x=b-a+1;
        int lg=(int)log2(x);
        cout<<min(d[a][lg],d[b-p2[lg]+1][lg])<<"\n";
    }
    return 0;
}