#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
long n,m,a[1000],d[1002][1002];
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
{
    in>>a[i];
    d[i][0]=a[i];
}
for(int j=1;(1<<j)<=n;j++)
{
    for(int i=1;i+(1<<j)-1<=n;i++)
        d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
for(int k=1;k<=m;k++)
{
    int x,y;
    in>>x>>y;
    int p=log2(y-x+1);
    int cmin=min(d[x][p],d[y-(1<<p)+1][p]);
    out<<cmin<<'\n';
}
    return 0;
}