#include <iostream>
#include <fstream>
///RMQ(range minimum query) Arbori de intervale
using namespace std;
ifstream fi("rmq.in");
ofstream fo("rmq.out");
struct
{
    int x;
    int y;
} intr[100001];
int n,m,a[100001],rmq[18][100001],log[100001];
int min(int a,int b)
{
    if(a<b)
        return a;
    else return b;
}
int main()
{
    fi>>n>>m;
    for(int i=1; i<=n; i++)
        fi>>a[i];
    for(int i=1; i<=m; i++)
        fi>>intr[i].x>>intr[i].y;
    log[1]=0;
    for(int i=2; i<=n; i++)
        log[i]=log[i/2]+1;
    for(int i=1; i<=n; i++)
        rmq[0][i]=a[i];
    for(int i=1; (1 << i)<=n; i++)
        for (int j=1; j<=n-(1<<i)+1; j++)
        {
            rmq[i][j]= min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
        }
    for(int j=1; j<=m; j++)
    {
        int i=log[intr[j].y-intr[j].x+1];
        //fo<<min(rmq[i][intr[j].x],rmq[i][intr[j].y-(1<<i)+1]);
        fo<<'\n';
    }
    return 0;
}