#include <bits/stdc++.h>

using namespace std;

int rmq[18][100009],n,m;

int logg (int baza,int nr)
{
    int ans=0;
    while (nr)
    {
        ans++;
        nr/=baza;
    }
    return ans-1;
}

int main()
{
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    fin>>n>>m;
    for (int i=1;i<=n;++i)
    {
        fin>>rmq[0][i];
    }
    //cout<<logg(2,100);
    int x=logg(2,n);
    for (int i=1;i<=x;++i)
    {
        for (int j=1;j<=n-(1<<i)+1;++j)
        {
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
        }
    }
    for (int i=1;i<=m;++i)
    {
        int st,dr;
        fin>>st>>dr;
        int lg=logg(2,dr-st+1);
        fout<<min(rmq[lg][st],rmq[lg][dr-(1<<lg)+1])<<"\n";;
    }
    return 0;
}