#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
#define NMAX 100002
#define LMAX 18

long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];

int minim(int a,int b)
{
    if (a<=b) return a;
    return b;
}

int main()
{
    int i,j,l;
    in>>n>>m;
    for (i=1;i<=n;i++) in>>a[i];
    lg[1]=0;//     lg[i]=logaritm in baza 2 din i
    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++)
        {
        l=1<<(i-1);
        rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
        }
    int x,y,diff,sh;

    for (i=1;i<=m;i++)
    {
        in>>x>>y;

        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        out<<minim(rmq[l][x],rmq[l][x+sh])<<endl ;
    }
    return 0;
}