#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100005;

int rmq[NMAX][20];
int p[NMAX];

int main()
{
    int n,m;
    fin >> n >> m;
    int x;
    for(int i=1;i<=n;i++)
    {
        fin >> x;
        rmq[0][i]=x;
    }
    for (int k=1;k<=20;k++)
    {
        for (int i=1;i<=n-(1<<k)+1;++i)
        {
            rmq[k][i]=min(rmq[k-1][i],rmq[k-1][i+(1<<(k-1))]);
        }
    }
    p[1]=0;
    for(int i=2;i<=n;i++)  p[i]=p[i/2]+1;
    int y,ind;
    for(int i=1;i<=m;i++)
    {
        fin >> x >> y;
        ind=p[y-x+1];
        fout << min(rmq[ind][x],rmq[ind][y+1-(1<<ind)]) << '\n';
    }
    return 0;
}