#include <fstream>
#include <iostream>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int M[100005][20];
int i,j,l,r,n,q;

int log(int n)
{
    int p = 1;
    int nr = 0;
    while(p<=n){
        p*=2;
        nr++;
    }
    return nr-1;
}
int main()
{

    f>>n>>q;
    for(i=1;i<=n;i++)
        f>>M[i][0];

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

    for(i=1;i<=q;i++){
        f>>l>>r;
        int len = log(r-l+1);
        g<<min(M[l][len], M[r-(1<<len) + 1][len])<<'\n';
    }


    return 0;
}