#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit 20
#define inf 500000000
#define N 100100
#define mod  1999999973
#define inu "rmq.in"
#define outu "rmq.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int D[bit][N],n,m,lg[N],t,po,a,b,dif,logu;
int main ()
{
	f>>n>>m;
	FOR(i,1,n)
	f>>D[0][i];
	FOR(i,2,n)
	lg[i]=lg[i/2]+1;
	for(t=1,po=1;po<=n;po<<=1,t++)
		for(int i=1;i<=n-po;++i)
			D[t][i]=min(D[t>>1][i],D[t>>1][i+po]);
	FOR(i,1,m)
	{
		f>>a>>b;
		dif=b-a+1;
		logu=lg[dif];
		dif-=(1<<logu);
		g<<min(D[logu][a],D[logu][a+dif])<<"\n";
	}
	return 0;
}