#include <fstream>
using namespace std;

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

const int N=100005;
int a[N],r[18][N],lg[N];

inline int min(int a,int b)
{
    return (a<b ? a:b);
}

int main()
{
    int n,m,i,j,x,y,dif;

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

    for(i=1;i<=n;i++)
        r[0][i]=a[i];

    for(i=1;(1<<i)<=n;i++)
        for(j=1; j<= n-(1<<i)+1; j++)
            r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);

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

    while(m--)
    {
        in>>x>>y;
        dif=y-x+1;
        out<< min(r[lg[dif]][x], r[lg[dif]][y-(1<<lg[dif])+1])<<"\n";
    }
}