#include <fstream>

using namespace std;
int rmq[22][100002], n;

ifstream cin("rmq.in");
ofstream cout("rmq.out");

void precalc() {
	for (int k = 1; (1 << k) <= n + 1; k++)
		for (int i = 1; i + (1 << k) <= n + 1; i++)
			rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][i + (1 << (k - 1))]);
}

int query(int i, int j) {
int k = 31 - __builtin_clz(j - i);
	return min(rmq[k][i], rmq[k][j - (1 << k) + 1]);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int m, a, b;
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        cin >> rmq[0][i];
    precalc();
    while(m--) {
        cin >> a >> b;
        cout << query(a, b) << '\n';
    }
    return 0;
}