#include <iostream>
#include <fstream>
using namespace std;

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


int n,m,x,y;
int mat[20][100001];
int p[20];
int lg[100001];

void solve()
{
    p[0]=1;
    for (int i=1;i<=18;i++)
            p[i]=2*p[i-1];

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

    for (int i=1;p[i]<=n;i++)
    {
        for (int j=1;j<=n;j++)
        {
            mat[i][j]=mat[i-1][j];
            if (j+p[i]<=n && mat[i][j]>mat[i-1][j+p[i-1]]){
                mat[i][j]=mat[i-1][j+p[i-1]];
            }
        }
    }

    for (int i=1;i<=m;i++)
    {
        fin>>x>>y;
        int exp=lg[x-y+1];
        fout<<min(mat[exp][x],mat[exp][y-p[exp]+1])<<'\n';

    }

}

int main()
{
    fin>>n>>m;
    for (int i=1;i<=n;i++) fin>>mat[0][i];
    solve();
}