#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,i,j,p,a[17][100010],x,y,d;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[0][i]);
    }
    for(i=1,p=1;2*p<=n;i++,p*=2)
    {
        for(j=1;j<=n-2*p+1;j++)
        {
            a[i][j]=min(a[i-1][j],a[i-1][j+p]);
        }
    }
    for(;m;--m)
    {
        scanf("%d%d",&x,&y);
        d=y-x+1;
        for(i=1,p=0;2*i<=d;i<<=1,++p);
        printf("%d\n",min(a[p][x],a[p][y-i+1]));
    }
    return 0;
}