#include <cstdio>

using namespace std;

int v[100005];
int a[100005][18];

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int n,m,x,y;

    scanf("%d %d",&n,&m);

    for(int i=1;i<=n;++i)
        scanf("%d",&v[i]);

    int log=0;
    for(log;(1<<log)<n;++log)
        log=log;
    --log;

    for(int i=1;i<=n;++i)
        a[i][0]=i;

    for(int j=1;j<=log;++j)
        for(int i=1;i<=n;++i)
            if(v[a[i][j-1]]<v[a[i+(1<<(j-1))][j-1]])
                a[i][j]=a[i][j-1];
            else
                a[i][j]=a[i+(1<<(j-1))][j-1];

    for(int i=1;i<=m;++i)
    {
        scanf("%d %d",&x,&y);
        int k=0;
        while((1<<(k+1))<y-x+1)
        {
            ++k;
        }
        if(v[a[x][k]]<v[a[y-(1<<k)+1][k]])
            printf("%d\n",v[a[x][k]]);
        else
            printf("%d\n",v[a[y-(1<<k)+1][k]]);
    }

    return 0;
}