/*#include <cstdio>
using namespace std;
int k,x,y,m,l,n,p,i,j,a[100010][17];
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    scanf("%d",&a[0][i]);
    a[0][0]=n;
    p=2;
    l=1;
    i=0;
    while(p<=n)
    {
        for(i=1;i+p-1<=n;i++)
        {
            a[l][0]++;
            if(a[l-1][i]<a[l-1][i+p/2])
                a[l][i]=a[l-1][i];
            else  a[l][i]=a[l-1][i+p/2];
        }
        p=p<<1;
        l++;
        i=0;
    }
   for(i=0;i<=l;i++)
    {
        for(j=1;j<=a[i][0];j++)
        printf("%5d ",a[i][j]);
        printf("\n");
    }
    while(m)
    {
        m--;
        p=1;
        k=0;
        scanf("%d%d",&x,&y);
        if(x==y)
        {
            printf("%d\n",a[0][x]);
        }
        else
        {

            while(y-x+1>p)p=p<<1,k++;
        p/=2;k--;
        if(a[k][x]<a[k][y-p+1])
        printf("%d\n",a[k][x]);
        else printf("%d\n",a[k][y-p+1]);
        }
    }
    return 0;
}
*/
#include <stdio.h>
#include <vector>

using namespace std;

#define NMAX 100002
#define LMAX 18

long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);

    long int i,j,l;

    scanf("%ld %ld",&n,&m);

    for (i=1;i<=n;i++)
        scanf("%ld ",&a[i]);

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

    for (i=1;i<=n;i++)
        rmq[0][i]=a[i];

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

    long int x,y,diff,sh;
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld",&x,&y);

        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        printf("%ld\n",min(rmq[l][x],rmq[l][x+sh]) );
    }
    return 0;
}