#include <iostream>
#include <fstream>

using namespace std;

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

const int maxlg=20;
const int maxn=1000005;

int n, m;
int rmq[maxlg][maxn], lg[maxn];

int main()
{
    f>>n>>m;
    for(int i=2;i<=n; ++i)
    {
        lg[i]=lg[i/2]+1;
    }
    for(int i=1; i<=n;++i)
    {
        f>>rmq[0][i];
    }
    for(int k=1; (1<<k)<=n; ++k)
    {
        for(int i=1; i<=n; ++i)
        {
            rmq[k][i]=min(rmq[k-1][i], rmq[k-1][i+(1<<(k-1))]);
        }
    }
    for(int i=1; i<=m; ++i)
    {
        int x, y;
        f>>x>>y;
        int l=lg[y-x+1];
        int answer=rmq[l][x];
        if(rmq[l][y-(1<<l)+1]<answer)
        {
            answer=rmq[l][y-(1<<l)+1];
        }
        g<<answer<<endl;
    }
    return 0;
}