#include<cstdio>
int n,m,a[100001],i,j,b[100001][18],k,x,y;
int main()
{freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
      scanf("%d",&a[i]),b[i][0]=i;
for(j=1;(1<<j)<=n;j++)
for(i=0;i+(1<<j)-1<n;i++)
      b[i][j]=a[b[i][j-1]]<a[b[i+(1<<(j-1))][j-1]]?b[i][j-1]:b[i+(1<<(j-1))][j-1];            
while(m--)
      {scanf("%d%d",&x,&y),x--,y--;
      for(k=1;(1<<k)<=y-x+1;k++);
      k--;
      printf("%d\n",a[b[x][k]]<a[b[y-(1<<k)+1][k]]?a[b[x][k]]:a[b[y-(1<<k)+1][k]]);}
return 0;}