#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int puteremax=17;
int rmq[puteremax][1<<puteremax],n,a[1<<puteremax],p2[1<<puteremax],query;
inline void Build()
{
    p2[1]=0;
    for(int i=2;i<=n;i++)
        p2[i]=1+p2[i/2];
}
inline void Build_RMQ()
{
    for(int i=1;i<=n;i++)
        rmq[0][i]=a[i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=(1<<i);j<=n;j++)
    {
        int k=(1<<(i-1));
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j-k]);
    }
}
inline void Solve()
{
    for(int i=1;i<=query;i++)
    {
        int x,y,lg;
        fin>>x>>y;
        lg=y-x+1;
        int k=p2[lg];
        fout<<min(rmq[k][x+(1<<k)-1],rmq[k][y])<<"\n";
    }
}
int main()
{
    fin>>n>>query;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    Build();
    Build_RMQ();
    Solve();
    fin.close();
    fout.close();
    return 0;
}