#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define Max 100001

int c[Max][18],n;

void rmq()
{
    for(int j=1;(1<<j)<=n;j++)
    for(int i=1;i+(1<<(j-1))<=n;i++)
    c[i][j] = min(c[i][j-1],c[i+(1<<(j-1))][j-1]);
}

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

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

        rmq();

      /*  for(int i=1;i<=20;i++)
        {
            for(int j=0;j<10;j++)printf("%d ",c[i][j]); printf("\n");
        }
        */
    while(m--)
    {
        scanf("%d %d",&x,&y);
        k = log(y-x+1)/log(2);
        printf("%d\n",min(c[x][k],c[y-(1<<k)+1][k]));
    }

    return 0;
}