#include <cstdio>
#include <algorithm>
#include <cmath>
#define Nmax 100005
using namespace std;
int rmq[Nmax][20];
int n,m;

void read()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i = 0 ; i < n ; i++)
        scanf("%d",&rmq[i][0]);
}

void RMQ()
{
    int lim = floor(log2(n));
    for(int i = 1 ; i <= lim ; i++)
    {
        int power = (1 << (i - 1));
        for(int j =  0 ; j < n ; j++)
        {
            if( i + power <= n - 1)
                rmq[j][i]=min(rmq[j][i - 1],rmq[j+power][i-1]);
            else
                rmq[j][i]=rmq[j][i-1];

        }
    }
}

void intrebari()
{
    int x ,y;
    for(int i = 0 ; i < m ; i++)
    {
        scanf("%d %d",&x,&y);
        x--;
        y--;
        int ind = (int)log(y-x+1);
        int raspuns = min(rmq[x][ind],rmq[y - ( 1 << (ind-1))][ind]);
        printf("%d\n",raspuns);
    }
}

int main()
{
    read();
    RMQ();
    intrebari();
    return 0;
}