/*#include <iostream>
#include <fstream>
#define nmax 100003
#define lgmax 19
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, i, m;
int v[nmax], lg[nmax], mat[nmax][18];

void lg_find()
{
  lg[1] = 0;
  for(i = 2; i <= nmax; i++)
    lg[i] = lg[i>>1] + 1;
}

void fill_v()
{
  for(i = 1; i <= n; i++)
    fin >> v[i], mat[i][1] = i;
}

void rmq()
{
  int j, k;
  k = lg[n];
  for(j = 1; j <= k; j++)
  {
    for(i = 1; i + (1<<j) - 1 <= n; i++)
    {
      if(v[mat[i][j]] < v[mat[i + (1<<(j-1))][j]])
        mat[i][j+1] = mat[i][j];
      else
        mat[i][j+1] = mat[i + (1<<(j-1))][j];
    }
  }
}

void answer_questions()
{
  int a, b, k, y;
  for(i = 0; i < m; i++)
  {
    fin >> a >> b;
    k = lg[b-a+1];
    y = b - (1<<(k)) + 1;
    if(v[mat[a][k+1]] < v[mat[y][k+1]])
      fout << v[mat[a][k+1]];
    else
      fout << v[mat[y][k+1]];
    fout << '\n';
  }
}

int main()
{
    lg_find();
    fin >> n >> m;
    fill_v();
    rmq();
    answer_questions();
    return 0;
}
*/
#include <stdio.h>
#include <vector>

using namespace std;

#define NMAX 100002
#define LMAX 18

long int rmq[LMAX][NMAX];
long int n,m;
long int lg[NMAX];
long int a[NMAX];

int main()
{
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);

	long int i,j,l;

	scanf("%ld %ld",&n,&m);

	for (i=1;i<=n;i++)
		scanf("%ld ",&a[i]);

	lg[1]=0;
	for (i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;

	for (i=1;i<=n;i++)
		rmq[0][i]=a[i];

	for (i=1; (1 << i) <=n;i++)
		for (j=1;j <= n - (1 << i)+1;j++)
		{
		l=1<<(i-1);
		rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+l] );
		}

	long int x,y,diff,sh;

	for (i=1;i<=m;i++)
	{
		scanf("%ld %ld",&x,&y);

		diff=y-x+1;
		l=lg[diff];
		sh=diff - (1<<l);
		printf("%ld\n",min(rmq[l][x],rmq[l][x+sh]) );
	}
	return 0;
}