#include <bits/stdc++.h>
using namespace std;
int sp[100005][35], v[100005];
void build(int n)
{
	for(int i=1; i<=n; i++)
		sp[i][0]=v[i];
	for(int j=1; (1<<j)<=n; j++)
	{
		for(int i=1; i+(1<<j)-1<=n; i++)
		{
			sp[i][j]=min(sp[i][j-1], sp[i+(1<<(j-1))][j-1]);
		}
	}
	return;
}
int query(int l, int r)
{
	int len=r-l+1, x=0;
	while(len>0)
	{
		len/=2;
		x++;
	}
	x--;
	return min(sp[l][x], sp[r-(1<<x)+1][x]);
}
int main()
{
	ifstream cin("rmq.in");
	ofstream cout("rmq.out");
	int n, m, x, y;
	cin>>n>>m;
	for(int i=1; i<=n; i++)
		cin>>v[i];
	build(n);
	for(int i=1; i<=m; i++)
	{
		cin>>x>>y;
		cout<<query(x, y)<<'\n';
	}
    return 0;
}