#include<cstdio>
#include<algorithm>
using namespace std;
int V[10002],LG[10002],n,m,i,j,a,b,M[10002][20],k;
void read(),solve();
int main()
{
	read();
	solve();
	return 0;
}
void read()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
	scanf("%d%d",&n,&m);
	
	for(i=2;i<=n;i++) LG[i]=LG[i/2]+1;
	for(i=1;i<=n;i++) scanf("%d",&V[i]),M[0][i]=i;
	
	for (i = 1; (1<<i) <= n; i++)
          for (j = 1; j <= n-(1<<i)+1; j++)
		  {
			  k = (1<<(i-1));
              if (V[M[i-1][j]] < V[M[i-1][j+k]])
                  M[i][j] = M[i-1][j];
              else
                  M[i][j] = M[i-1][j+k];
		  }

}
void solve()
{
	int lg, dif, t;
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&a,&b);
		t = b-a+1;
		lg = LG[t];
		dif = t - (1<<lg);
		printf("%d\n",min(V[M[lg][a]],V[M[lg][a+dif]]));
	}
}