/*
It always seems impossible until its done.
**/
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int NMAX=100005;
int Rmq[19][NMAX],Log[NMAX],a[NMAX];
int n,m,x,y;
inline void Build_Rmq()
{
    for(int i=1;i<=n;i++)
        Rmq[0][i]=a[i];
    for(int i=2;i<=n;i++)
        Log[i]=1+Log[i/2];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<i)-1<=n;j++)
            Rmq[i][j]=min(Rmq[i-1][j],Rmq[i-1][j+(1<<(i-1))]);
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        f>>a[i];
    Build_Rmq();
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        int sz=y-x+1;
        int lngscv=Log[sz];
        int a=Rmq[lngscv][x];
        int b=Rmq[lngscv][y-(1<<lngscv)+1];
        g<<min(a,b)<<"\n";
    }
    return 0;
}