#include<cstdio>
using namespace std;
#define big 100005
int n,m,a[18][big],l,x,sol,y;
void citire()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[0][i]);
    }
}
int log(int x)
{
    int k;
    k=1;int nr;
    nr=0;
    while(k*2<=x)
    {
        k*=2;
        nr++;
    }
    return nr;
}
int minim(int a,int b)
{
    return((a<b)?a:b);
}
int query(int x,int y)
{
    int grd,sol;
    grd=log(y-x+1);
    sol=minim(a[grd][x],a[grd][y-(1<<grd)+1]);
    return sol;
}
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);

    citire();
    l=log(n);
    for(int i=1;i<=l;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
        {
            a[i][j]=minim(a[i-1][j],a[i-1][j+(1<<(i-1))]);
        }
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        sol=query(x,y);
        printf("%d\n",sol);
    }
    return 0;
}