#include <stdio.h>

#define min(a, b) a < b ? a : b
#define infinit 1<<20

int sir[500000];

void update(int nod, int st, int dr, int pos, int val)
{
	if(st == dr && st == pos)
	{
		sir[nod] = val;
		return;
	}

	int half = (st + dr) / 2;

	if(pos <= half)
		update(2 * nod, st, half, pos, val);
	else
		update(2 * nod + 1, half + 1, dr, pos, val);

	sir[nod] = min(sir[2 * nod + 1], sir[2 * nod]);
}

int minint(int nod, int st, int dr, int a, int b)
{
	if(a <= st && dr <= b)
        return sir[nod];

	int x=infinit, y=infinit, half = (st + dr) / 2;

	if(a <= half)
		x = minint(2 * nod, st, half, a, b);

	if(b >= half + 1)
		y = minint(2 * nod + 1, half + 1, dr, a, b);

    return min(x, y);
}

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

	int n, m, i, a, b, q;

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

	for(i = 1;i <= n;i++)
	{
		scanf("%d", &q);
		update(1, 1, n, i, q);
	}

	for(i = 0;i < m;i++)
	{
		scanf("%d %d", &a, &b);
		printf("%d\n", minint(1, 1, n, a, b));
	}

	return 0;
}