#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, j, rmq[20][100005], log[100005], v[100005], a, b;


void build()//rmq[k][i] inseamna minimul din secventa care incepe pe pozitia i si are 2^k elemente . in O(n * log n)
{
    for(int i=1;i<=n;i++)
        rmq[0][i]=v[i];
    for(int k=1;k<=log[n];k++)
        for(int i=1;i<=n-(1<<k)+1;i++)
            rmq[k][i]=min(rmq[k-1][i],rmq[k-1][i+(1<<(k-1))]);
}
int query(int a, int b)// se face in O(1)
{
    int l=log[b-a+1];
    return min(rmq[l][a],rmq[l][b-(1<<l)+1]);
}
int main()
{
    fin>>n>>m;
    log[0]=-1;
    for(i=1;i<=n;i++)
        log[i]=1+log[i/2];
    for(i=1;i<=n;i++)
        fin>>v[i];
    build();
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;
        fout<<query(a,b)<<'\n';
    }
    return 0;
}