#include <cstdio>
#include <algorithm>
using namespace std;
int lg[30],d[30][100005],i,j,p,n,m,x,y,a[100005];
int main()
{freopen("rmq.in","r",stdin);
 freopen("rmq.out","w",stdout);
 scanf("%d%d",&n,&m);
 lg[1]=0;
 for(i=2;i<=n;i++)
    {lg[i]=lg[i/2]+1;
    }
 for(i=1;i<=n;i++)
    {scanf("%d",&a[i]);
     d[0][i]=a[i];
    }
 for(i=1;i<=lg[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);
     p=lg[y-x+1];
     printf("%d\n",min(d[p][x],d[p][y-(1<<p)+1]));
    }
}