#include <iostream>
#include <fstream>
#include <math.h>
#include <bitset>
#include <unordered_map>

using namespace std;

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

#define int long long
#define cin in
#define cout out

const int N = 1e5 + 1;
const int LOGNMAX = 5000;

int M[100002][20];
int A[100002];
int lg[100002];

int n, q;

signed main()	
{
	cin >> n >> q;
	for (int i = 1; i <= n; i++)
		cin >> A[i];
	for (int i = 1; i <= n; i++)
	{
		M[i][0] = i;
	}
	A[0] = 99999999;
	for (int j = 1; (1ll << j) <= n; j++)
	{
		for (int i = 1; i + (1ll << (j-1)) - 1 <= n; i++)
		{
			if (A[M[i][j - 1]] < A[M[i + (1ll << (j - 1))][j - 1]])
				M[i][j] = M[i][j - 1];
			else
				M[i][j] = M[i + (1ll << (j - 1))][j - 1];
		}
	}
	lg[1] = 0;
	for (int i = 2; i <= n; i++)
	{
		lg[i] = 1 + lg[i / 2];
	}
	for (int i = 1; i <= q; i++)
	{
		int a, b;
		cin >> a >> b;
		int k = lg[b - a + 1];
		int rez = min(A[M[a][k]], A[M[b - (1ll << k) + 1][k]]);
		cout << rez << '\n';
	}
}