#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
int L[20], e[100005], rmq[20][100005],n,m,st,dr,k;
int main()
{
	fin >> n >> m;
	for (int i = 1; i <= n; i++)
		fin >> rmq[0][i];
	L[0] = 1;
	for (int i = 1; i <= 19; i++)
	{
		L[i] = L[i - 1] * 2;
	}
	for (int i = 2; i <= 100000; i++)
	{
		e[i] = e[i / 2] + 1;
	}
	for (int i = 1; i <= e[n]; i++)
	{
		for (int j = 1; j <= n - L[i]+1; j++)
		{
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L[i - 1]]);
		}
	}
	for (int i = 1; i <= m; i++)
	{
		fin >> st >> dr;
		if (dr < st)
			swap(st, dr);
		k = e[dr - st + 1];
		fout << min(rmq[k][st], rmq[k][dr - L[k] + 1])<<"\n";
	}


}