#include <fstream>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n,m;
int rmq[100001][21];
int best[100001];

int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        f>>rmq[i][0];
    best[2]=1;
    for(int i=3;i<=n;i++)
    {
        best[i]=best[i-1];
        if((1<<(best[i]+1))<=i)
            best[i]++;
    }
    for(int j=1;j<=best[n];j++)
        for(int i=1;i+(1<<j)-1<=n;i++)
            rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
    for(int test=1;test<=m;test++)
    {
        int x,y;
        f>>x>>y;
        g<<min(rmq[x][best[y-x+1]],rmq[y-(1<<best[y-x+1])+1][best[y-x+1]])<<'\n';
    }
    return 0;
}