#include <iostream>
#include <fstream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int rmq[17][100000], lg[100000], i, j, n, m, x, y;

int mn(int x, int y)
{
    int i;
    i=lg[y-x+1];
    if(rmq[i][x]<rmq[i][y-(1<<i)+1])
        return rmq[i][x];
    else
        return rmq[i][y-(1<<i)+1];
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        fin>>rmq[0][i];
    }
    for(i=1;(1<<i)<=n;i++)
    {
        for(j=1;j+(1<<i)-1<=n;j++)
        {
            if(rmq[i-1][j]<rmq[i-1][j+(1<<(i-1))])
                rmq[i][j]=rmq[i-1][j];
            else
                rmq[i][j]=rmq[i-1][j+(1<<(i-1))];
        }
    }
    lg[1]=0;
    for(i=2;i<=n;i++)
    {
        lg[i]=lg[i/2]+1;
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        fout<<mn(x,y)<<'\n';
    }
    return 0;
}