#include <cstdio>
#include <algorithm>
#define Nmax 100005
using namespace std;

FILE * in=fopen ("rmq.in","r");
FILE * out=fopen ("rmq.out","w");

int n,m,rmq[20][Nmax],lg[Nmax];

int query(int a,int b)
{
    int dif = b-a+1,l = lg[dif],ll=dif - (1<<l);
    return min(rmq[l][a],rmq[l][a+ll]);
}

int main()
{
    fscanf(in,"%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        fscanf(in,"%d",&rmq[0][i]);

    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;

    for(int i=1; (1<<i) <= n ;i++)
        for (int j=1; j <= n-(1<<i)+1; j++)
        {
            int l;
            l=1<<(i-1);
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    while(m--)
    {
        int a,b;
        fscanf(in,"%d%d",&a,&b);
        fprintf(out,"%d\n",query(a,b));
    }


    return 0;
}