#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int a[20][100001],log[100001],n,m,x,y,i,j,l;
int main()
{
    f>>n>>m;
    for(i=2;i<=n;i++)
        log[i]=log[i/2]+1;
    for(i=1;i<=n;i++)
        f>>a[0][i];
    for(i=1;i<=log[n];i++)
        for(j=1;(j+(1<<i)-1)<=n;j++){
            a[i][j]=a[i-1][j];
            if(a[i][j]>a[i-1][j+(1<<(i-1))])
                a[i][j]=a[i-1][j+(1<<(i-1))];
        }
    for(i=1;i<=m;i++){
        f>>x>>y;
        l=y-x+1;
        l=log[l];
        int Min=a[l][x];
        int dr=y-(1<<l)+1;
        if(Min>a[l][dr])
           Min=a[l][dr];
        g<<Min<<'\n';
    }
    return 0;
}