#include <iostream>
#include <cstdio>
#define NMAX 100000
#define NMAX 1000000
using namespace std;

int n,m;
long int v[NMAX],r[NMAX][18],log[NMAX];

int main()
{
    int a,b,i,j,rez,l;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1; i<=n; i++)
        scanf("%ld",&v[i]);
    for(i=2; i<=n; i++)
        log[i]=1+log[i/2];
    for (i=1; i<=n; i++)
        r[0][i]=v[i];

    for (i=1; (1 << i) <=n; i++)
        for (j=1; j <= n - (1 << i)+1; j++)
        {
            l=1<<(i-1);
            r[i][j]= min( r[i-1][j] , r[i-1][j+l] );
        }
    j=1;
    while(j<=m)
    {
        scanf("%ld %ld",&a,&b);
        l=log[b-a+1];
        printf("%ld\n",min(r[l][a],r[l][b+1-(1<<l)]) );
        j++;
    }
    return 0;
}
/// cum era inainte si nu mergea
/*for(i=1; i<=n; i++)
    {
        r[i][0]=v[i];
        for(j=1; (1<<j)<=i; j++)
            r[i][j]=min(r[i][j-1],r[i-(1<<(j-1))][j-1]);
    }
    for(i=1; i<=m; i++)
    {
        scanf("%d",&a,&b);
        l=log[b-1+1];
        rez=min(r[b][l],r[a+(1<<l)-1][l]);
        printf("%d\n",rez);
    }*/