#include<cstdio>
#define nmax 100010
#define logmax 17

int n, m, v[nmax], lg2[nmax]; 
int a[nmax][logmax];

int main()
{
 freopen("rmq.in", "r", stdin);
 freopen("rmq.out", "w", stdout);
 scanf("%d %d", &n, &m);
 int i, j;
 for(i=1; i<=n; i++)
  {
   scanf("%d", &v[i]);
   a[i][0] = v[i];
  }
	for(i=2; i<=n; i++)
		lg2[i] = lg2[i/2]+1;

 for(j = 1; (1<<j) <= n; j++)
  for(i = 1; i + (1<<j) <= n+1; i++)
   if(a[i][j-1] < a[i + (1<<(j-1))][j-1] )
			a[i][j] = a[i][j-1];
	else
			a[i][j] = a[i+ (1<<(j-1))][j-1];

 
 for(i=1; i<=n; i++)
  {
	for(j=0; (1<<j) <= n+1; j++)
		printf("%d ", a[i][j]);
	printf("\n");
	}
 

	int x, y, l;
	while(m>0)
	{
		scanf("%d %d", &x, &y);
		l = lg2[y-x+1];
		if(a[x][l] < a[y+1 - (1<<l)][l] )
			printf("%d\n", a[x][l]);
		else
			printf("%d\n", a[y+1 -(1<<l)][l] );
		m--;
	}
	return 0;
}