#include <bits/stdc++.h>
using namespace std;
#define MAX 100002
ifstream in("rmq.in");
ofstream out("rmq.out");
int sp[MAX][18];
int lg[MAX];
int a[MAX];

void buildSparseTable(int arr[], int n)
{
	for (int i = 0; i < n; i++)
		sp[i][0] = arr[i];

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

int query(int i, int j)
{
    int len = j-i+1;
	int k = lg[j - i + 1];

	return min(sp[i][k], sp[i+len-(1<<k)][k]);
}

int main()
{
	int n,i,m;
	in>>n>>m;
	for(i=0;i<n;i++)
        in>>a[i];

    for(int i=2; i<=MAX; i++)
        lg[i] = 1 + lg[i/2];

	buildSparseTable(a, n);
	int k = lg[n];
    int x,y;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        out<<query(x-1,y-1)<<'\n';
    }
	return 0;
}