#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int i,n,lo[1000001],rmq[25][200001],j,m,x,y,z;
int main()
{
    in>>n>>m;
    for (i=2;i<=n;++i)
        lo[i]=lo[i/2]+1;
        for(i=1; i<=n; i++)
    {
        in>>rmq[0][i];
    }
    for(i=1;i<=lo[n];i++)
        for(j=1;j<=n;j++)
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        z=y-x+1;
        z=lo[z];
        out<<min(rmq[z][x],rmq[z][y-(1<<z)+1])<<'\n';
    }
 return 0;
}
//1      2      3      4      5      6      7      8
//1-2    2-3    3-4    4-5    5-6    6-7    7-8
//1-4    2-5    3-6    4-7    5-8
//1-7    2-8
//1      2      3      4      5      6      7
//12     23     34     45     56     67
//14     25     36     47
//17