#include <bits/stdc++.h>
using namespace std;
int n,m,v[100005],RMQ[17][100005],lg[100005];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        RMQ[0][i]=i;
        if (i>1) lg[i]=lg[i>>1]+1;
    }
    for (int i=1;(1<<i)<=n;i++)
    {
        for (int j=1;j<=n-(1<<i)+1;j++)
        {
            int l=1<<(i-1);
            RMQ[i][j]=RMQ[i-1][j];
            if (v[RMQ[i-1][j+l]]<v[RMQ[i][j]])
                RMQ[i][j]=RMQ[i-1][j+l];
        }
    }
    int x,y,dif,l,sh,sol;
    while (m--)
    {
        scanf("%d %d",&x,&y);
        if (x>y) swap(x,y);
        dif=y-x+1,l=lg[dif],sh=dif-(1<<l);
        sol=RMQ[l][x];
        if (v[RMQ[l][x+sh]]<v[sol])
            sol=RMQ[l][x+sh];
        printf("%d\n",v[sol]);
    }
    return 0;
}