#include <cstdio>

using namespace std;

int d[100010][18],p[100010];

inline int min(int a,int b)
{
    if (a>b) return b;
    else return a;
}

int main()
{
    int n,m,i,j,k,aux,x,y;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d\n",&n,&m);
    for (i=1;i<=n;++i)
        scanf("%d\n",&d[i][0]);
    for (p[1]=0,i=2;i<=n;++i)
        p[i]=p[i/2]+1;
    for (i=1;(1<<i)<n;++i)
    {
        for (j=1;j<=n-(1<<i)+1;++j)
            d[j][i]=min(d[j][i-1],d[j+(1<<(i-1))][i-1]);
        d[n][i]=d[n][0];
        for (k=n-1;k>=j;--k)
            d[k][i]=min(d[k][i+1],d[k][0]);
    }
    for (i=1;i<=m;++i)
    {
        scanf("%d %d\n",&x,&y);
        aux=p[y-x+1];
        printf("%d\n",min(d[x][aux],d[y-(1<<aux)+1][aux]));
    }
    return 0;
}