#include <bits/stdc++.h>
//rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+2^(i-1)-1])
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int a[100001],rmq[33][100001];
int lg[100001];
int main()
{int i,n,j,m,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
{
    in>>a[i];
    rmq[0][i]=a[i];
}
for(i=1;(1<<i)<=n;i++)
{
    for(j=1;j+(1<<i)-1<=n;j++)
    {
        rmq[i][j]=min(rmq[i-1][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++)
{
    in>>x>>y;
    j=lg[y-x+1];
    out<<min(rmq[j][x],rmq[j][y-(1<<j)+1])<<'\n';
}
    return 0;
}