#include <cstdio>
#include <algorithm>
using namespace std;
int d[18][100001],x,y,i,j,n,m,z;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
     scanf("%d %d",&n,&m);
     for(i=1;i<=n;++i)
           scanf("%d",&d[0][i]);
     for(i=1;(1<<i)<=n;++i)
     {
       for(j=1;j<=n-(1<<(i-1));++j)
          d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
     }

   for(i=1;i<=m;++i)
   {   scanf("%d %d",&x,&y);
       z=1;
       while((1<<z+1)<=x-y+1)
            z++;
    printf("%d\n",min(d[z][x],d[z][y-(1<<z)+1]));
   }
    return 0;
}