#include <iostream>
#include <fstream>
#define MAX_N 100001
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,v[MAX_N],r[19][100001],EXP[MAX_N];
int main()
{
    f>>n>>m;
    EXP[1]=0;
    for (int i=2; i<=n; i++)
    {
        EXP[i]=1+EXP[i/2];
    }
    for (int i=1; i<=n; i++)
        f>>v[i];
    for (int i=1; i<=n; i++)
        r[0][i]=v[i];
        //cout<<'\n';
    for (int l=1; (1<<(l))<=n; l++)
    {
        for (int i=1; i<=n; i++)
        {
            r[l][i]=r[l-1][i];
            int j=i+(1<<(l-1));
            if (j<=n)
            r[l][i]=min(r[l][i],r[l-1][j]);
         //   cout<<r[l][i]<<' ';
        }
       // cout<<'\n';
    }
    for (int i=1; i<=m; i++)
    {
        int a,b,length;
        f>>a>>b;
        length=b-a;
        g<<min(r[EXP[length]][a],r[EXP[length]][b-(1<<EXP[length])+1])<<'\n';
    }
    return 0;
}