#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "rmq"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 100001
#define INF 0xffffff

int n,a[MAX][19];

void RMQ()
{
	for(int j=1;(1<<j)<=n;j++)
	for(int i=1;i+(1<<j)-1<=n;i++)
		a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);	
	// start
	int m,x,y,k;
	scanf("%d %d",&n,&m);
		for(int i=1;i<=n;i++)scanf("%d",&a[i][0]);
		RMQ();
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d",&x,&y);
			k=log(double(y-x+1))/log(double(2));
			printf("%d\n",min(a[x][k],a[y-(1<<k)+1][k]));
		}
	return 0;
}