#include <bits/stdc++.h>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

int lookup[20][100005],v[100001],len,n,m;


int main()
{

    int i,a,b,j,scad;
    f>>n>>m;
    for(i=1;i<=n;i++)
     f>>lookup[0][i];
     for(i=1;(1<<i)<=n;i++)
     for(j=1;j+(1<<i)-1<=n;j++)
     lookup[i][j]=min(lookup[i-1][j],lookup[i-1][j+(1<<(i-1))]);
     for(i=1;i<=m;i++)
     {
         f>>a>>b;
         j=log2(b-a+1);
         g<<min(lookup[j][a],lookup[j][b-(1<<j)+1])<<'\n';
     }

}