#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,a[100005],d[50][100005],W,put[100005];
void make_put()
{
    int i;
    put[1]=0;
    for (i=2;i<=n;i++)
       put[i]=put[i/2]+1;
}
void make_d()
{
    int i,j,L,M;
    for (j=1;j<=n;j++)d[0][j]=a[j];
    for (i=1;i<=W;i++)
    {
        L=(1<<(i-1));
        M=n-(1<<i) + 1;
        for (j=1;j<=M;j++)
        {
            d[i][j]=min(d[i-1][j],d[i-1][j+L]);
        }
    }
}
int main()
{int i,x,y,j,P;
    in>>n>>m;
    make_put();
    W=put[n];
    for (i=1;i<=n;i++)in>>a[i];
    make_d();
    for (i=1;i<=m;i++)
    {
        in>>x>>y;
        P=put[y-x+1];
        out<<min(d[P][x],d[P][y-(1<<P)+1])<<"\n";
    }
    out.close();
    in.close();
    return 0;
}