#include <iostream>
#include <fstream>
#include <queue>
#include <algorithm>
#include <climits>
#include <stdlib.h>
#include <vector>
#include <cstring>
#include <iomanip>
#include <cmath>
#include <bitset>
#include <assert.h>
#include <stack>
#include <numeric>
#include <set>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, rmq[21][100005];
int lg2[100005];
int q;

int main()
{
	fin >> n >> q;
	for (int i = 1; i <= n; i++)
	{
		fin >> rmq[0][i];
		if(i!=1)
			lg2[i] = 1 + lg2[i >> 1];
	}
	for (int i = 1; i <= lg2[n]; i++)
		for (int j = (1 << i); j <= n; j++)
			rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j - (1 << (i - 1))]);
	while (q--)
	{
		int x, y;
		fin >> x >> y;
		int l = lg2[y - x + 1];
		fout << min(rmq[l][x], rmq[l][y-(1<<l)+1] )<< '\n';
	}


	return 0;
}