#include <fstream>
#include <iostream>

using namespace std;

const int maxn=100002;
const int LMAX=18;

int rmq[LMAX][maxn];
int n,m;
int lg[maxn];
int a[maxn];

int main()
{

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

    long int i,j,k;

    f>>n>>m;


    for (i=1;i<=n;i++)
        f>>a[i];

    lg[1]=0;
    for (i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for (i=1;i<=n;i++)
        rmq[0][i]=a[i];

    for (i=1; (1 << i) <=n;i++)
        for (j=1;j <= n - (1 << i)+1;j++)
        {
        k=1<<(i-1);
        rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+k] );
        }
    long int x,y,diff,sh;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        diff=y-x+1;
        k=lg[diff];
        sh=diff - (1<<k);
        g<<min(rmq[k][x],rmq[k][x+sh])<<'\n';
    }
    return 0;
}