#include<bits/stdc++.h>
using namespace std;

const int NMAX=100002;
const int LMAX=18;

int rmq[LMAX][NMAX],lg[NMAX],v[NMAX];

int main(){
	freopen("rmq.in","r",stdin);
	freopen("rmq.out","w",stdout);
    int n,m;
	scanf("%d%d", &n, &m);
	for(int i=1;i<=n;i++)
		scanf("%d", &v[i]);
	lg[1]=0;
	for(int i=2;i<=n;i++)
		lg[i]=lg[i/2]+1;
	for(int i=1;i<=n;i++)
		rmq[0][i]=v[i];
	for(int i=1;(1<<i)<=n;i++)
		for(int j=1;j<=n-(1<<i)+1;j++){
            int l=1<<(i-1);
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+l]);
		}
	for(int i=1;i<=m;i++){
        int x,y,dif,l;
		scanf("%d%d", &x, &y);
		dif=y-x+1;
		l=lg[dif];
		printf("%d\n", min(rmq[l][x], rmq[l][x+dif-(1<<l)]));
	}
	return 0;
}