#include <cstdio>
#include <algorithm>
using namespace std;
int N,M,v[100005],lg[100005],rmq[18][100005];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d",&N,&M);
    for (register int i=1;i<=N;i++)
    {
        scanf("%d",&v[i]);
        rmq[0][i]=i;
        if (i>=2) lg[i]=lg[i>>1]+1;
    }
    for (register int i=1;(1<<i)<=N;i++)
    {
        for (register int j=1;j<=N-(1<<i)+1;j++)
        {
            int x=1<<(i-1);
            if (v[rmq[i-1][j]]<v[rmq[i-1][j+x]]) rmq[i][j]=rmq[i-1][j];
            else rmq[i][j]=rmq[i-1][j+x];
        }
    }
    for (register int i=1;i<=M;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        int diff=y-x+1,l=lg[diff],sh=diff-(1<<l);
        if (v[rmq[l][x]]<v[rmq[l][x+sh]]) printf("%d\n",v[rmq[l][x]]);
        else printf("%d\n",v[rmq[l][x+sh]]);
    }
    return 0;
}