#include <bits/stdc++.h>

using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n,i,j,m,x,y,nr;
int ve[25][100001],v[100001];
void rmq(int ve[25][100001],int n)
{
    int i,j;
    for (i=1; (1<<i)<=n; i++)
    {
        for (j=1; j<=n; j++)
        {
            //if (v[ve[i][j-1]]<v[j])
                ve[i][j]=ve[i-1][j];
        if(ve[i-1][j+(1<<(i-1))]<ve[i-1][j] && (j+(1<<(i-1)))<=n)
               ve[i][j]=ve[i-1][j+(1<<(i-1))];}
    }
}
int main()
{
    fin>>n>>m;
    for (i=1; i<=n; i++)
        {fin>>ve[0][i];
        //ve[0][i]=v[i];
        }
        rmq(ve,n);
        for (i=2; i<=n; i++)
             v[i]=v[i/2]+1;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        nr=v[y-x+1];
        fout<<min(ve[nr][x],ve[nr][y-(1<<nr)+1])<<'\n';
    }
    fout.close();
    return 0;
}