#include <cstdio>
#include <algorithm>
using namespace std;
#define INF 100001
#define LOG 30


int n,m,l,lg2[INF],v[LOG][INF],x,y,d;

int main()
{

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