#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;

int a[17][100002];

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

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>a[0][i];
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j<=n-(1<<i)+1;j++)
            a[i][j]=min(a[i-1][j], a[i-1][j+(1<<(i-1))]);
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        fin>>x>>y;
        z=log2(y-x+1);
        fout<<min(a[z][x], a[z][x+(y-x+1)-(1<<z)])<<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}