#include <iostream>
#include <fstream>
using namespace std;

ifstream f("rmq.in");
ofstream ff("rmq.out");

int n,m,x,y,r[20][100001],pow2[25],log;

int main()
{
    f>>n>>m;
    int lim=0,p=1;
    pow2[0]=1;
    while(p<=n)
    {
        lim++;
        p*=2;
        pow2[lim]=p;
    }
    lim--;
    for(int i=1;i<=n;i++)
        f>>r[0][i];
    for(int k=1;k<=lim;k++)
    {
        for(int i=1;i<=n;i++)
        {
            r[k][i]=min(r[k-1][i],r[k-1][i+pow2[k-1]]);
        }
    }
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        log=0;
        while(pow2[log]<=(y-x))
            log++;
        log--;
        ff<<min(r[log][x],r[log][y-pow2[log]+1])<<"\n";
    }
    return 0;
}