#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
int d[100003][30],v[100003],p[100003];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m,i,j,l,a,b,c,e;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
    scanf("%d",&v[i]);
    d[i][1]=v[i];
    }
    l=log2(n)+1;
    p[1]=1;
    for(i=2;i<=l;i++)
    p[i]=p[i-1]*2;
    for(j=2;j<=l;j++)
    {
    for(i=1;i<=n-p[j-1];i++)
    {
    if(d[i][j-1]<=d[i+p[j-1]+1][j-1])
    d[i][j]=d[i][j-1];
    else
    d[i][j]=d[i+p[j-1]+1][j-1];
    }
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        if(a==b)
        printf("%d\n",v[a]);
        else
        {
        c=log2(b-a)+1;
        printf("%d\n",min(d[a][c],d[b-p[c]][c]));
        }
    }
    return 0;
}