#include <fstream>
#include <algorithm>
using namespace std;

ifstream in("x.in");
ofstream out("x.out");

int n,m;
const int N=100001,L=21;
int lg[N],v[L][N];

int main()
{
    int i,j,k;
    in >> n >> m;
    in>>v[0][1];
    for(i=2;i<=n;i++)
    {
        in>>v[0][i];
        lg[i]=lg[i/2]+1;
    }
    for(i=1;i<=lg[n]+1;i++)
    {
        k= 1<<i-1;
        for(j=1;j<=n-k*2+1;j++)
            v[i][j]=min(v[i-1][j],v[i-1][j+k]);
    }

    int dif,l,r,x,y;
    for(i=0;i<m;i++)
    {
        in >> x >> y;
        dif=y-x+1;
        l=lg[dif];
        r=dif-(1<<l);
        out<<min(v[l][x],v[l][x+r])<<"\n";
    }

    return 0;
}