#include <bits/stdc++.h>
using namespace std;
long int d[18][100005],n,m,x,y,k;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;++i)
        scanf("%d ",&d[0][i]);
   for(int i=1;(1<<i)<=n;++i)
    for(int j=1;j<=n-(1<<i)+1;++j)
        d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
    while(m--)
    {
       scanf("%d %d",&x,&y);
        k=log2(y-x+1);
        printf("%d\n",min(d[k][x],d[k][y-(1<<k)+1]));
    }
     return 0;
}