#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

const int NMax = 100005;

int N, M;
int r[NMax][20];

void RMQ()
{
    int jmax=floor(log2(N))+1;

    for(int j=1; j<jmax; ++j)
        for(int i=0; i<N; ++i)
        {
            if(i+(1<<(j-1))<N)
                r[i][j]=min(r[i][j-1], r[i+(1<<(j-1))][j-1]);

            else
                r[i][j]=r[i][j-1];
        }
}

void Read()
{
    scanf("%d%d", &N, &M);

    for(int i=1; i<=N; ++i)
    {
        int x;
        scanf("%d", &x);
        r[i-1][0]=x;
    }

    RMQ();

    for(int i=0; i<N; ++i)
        {for(int j=0; j<=3; ++j)
        cout<<r[i][j]<<" ";
        cout<<"\n";}

     for(int i=1; i<=M; ++i)
    {
        int x,y;
        scanf("%d%d", &x, &y);
        x--;
        y--;
        int j=int(log2(y-x+1));
        printf("%d\n", min(r[x][j], r[y-(1<<j)+1][j]));
    }

}

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

    return 0;
}