#include <fstream>
#include <algorithm>
using namespace std;
 ifstream fin("rmq.in");
ofstream fout("rmq.out");
int v[100005];
int mat[100005][20];
char buff[4096];
int pbuf=4095;
void readbuff()
{
    pbuf=0;
    fin.read(buff,4095);
}
int citire()
{
    int nr=0;
    if(pbuf==4095)
    {
        readbuff();
    }
    while(buff[pbuf]<'0'||buff[pbuf]>'9')
    {
        pbuf++;
        if(pbuf==4095)
        {
            readbuff();
        }
    }
    while(buff[pbuf]>='0'&&buff[pbuf]<='9')
    {
        nr=nr*10+buff[pbuf]-'0';
        pbuf++;
        if(pbuf==4095)
        {
            readbuff();
        }
    }
    return nr;
}
int main()
{
    int n,m;
    n=citire();m=citire();
    int lgn=0,put=1;
    while(put<=n)
    {
        put*=2;
        lgn++;
    }
    lgn--;
    for(int i=1;i<=n;i++)
    {
        v[i]=citire();
    }
    for(int i=1;i<=n;i++)
    {
        mat[i][0]=v[i];
    }
    put=1;
    for(int i=1;i<=lgn;i++)
    {
        put*=2;
        for(int j=1;j<=n-put+1;j++)
        {
            mat[j][i]=min(mat[j][i-1],mat[j+put/2][i-1]);
        }
    }
    int a,b,lung,lgi;
    for(int i=1;i<=m;i++)
    {
        a=citire();b=citire();
        put=1;lung=b-a+1;lgi=0;
        while(put<=lung)
        {
            put*=2;
            lgi++;
        }
        put/=2;lgi--;
        fout<<min(mat[a][lgi],mat[b-put+1][lgi])<<'\n';
    }
    return 0;
}