/**
infoarena.ro/problema/rmq
Range Minimum Query
*/
#include <fstream>
#include <cstring>
using namespace std;
int n,q;
const int nmax=0x3f3f3f3f3f3f3f3f;
int log2[100010];
int m[100010][20];
void logaritm()
{
     for(int i=2;i<=n;i++)
    {
        log2[i]=log2[i/2]+1;
    }
}
void precalc()
{

    for(int j=1;(1<<j)<=n;j++)
    {
        for(int i=1;i<=n-(1<<j)+1;i++)
        {
            m[i][j]=min(m[i][j-1],m[i+(1<<(j-1))][j-1]);
        }
    }
}
int interval(int x,int y)
{
    int p=log2[y-x+1];
        return min(m[x][p],m[y-(1<<p)+1][p]);
}
int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin>>n>>q;
    memset(m,nmax,sizeof m);
    for(int i=1; i<=n; i++)
    {
        fin>>m[i][0];
    }
    logaritm();
    precalc();
    int x,y;
    while(q--)
    {
       fin>>x>>y;
       fout<<interval(x,y)<<endl;
    }
    return 0;
}