#include <cstdio>
#include <cmath>

const int N = 100000;
const int lgN = 17;
const int INF = 0x3f3f3f3f;

int n,m;
int a[N];
int d[lgN][N];

inline int min ( int a, int b ) { return (a < b) ? a : b; }

int main() {
	freopen("rmq.in","rt",stdin);
	freopen("rmq.out","wt",stdout);
	scanf("%d %d",&n,&m);
	for (int i = 0; i < n; ++i) scanf("%d",&a[i]);

	for (int j = 1; j < lgN; ++j)
		for (int i = 0; i < n; ++i)
			d[j][i] = INF;

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

	int p,q,ans;
	for (int i = 0; i < m; ++i) {
		scanf("%d %d",&p,&q);
		--p; --q;
		if (p == q) {
			ans = a[p];
		} else {
			int k;
			for (k = 0; (1 << (k+1)) <= q-p; ++k);
			ans = min(d[k][p],d[k][q-(1<<k)+1]);
		}
		printf("%d\n",ans);
	}
}