#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int d[100005][30], a[100005];
int n, m, x, y;
int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; i++) {
        in >> a[i];
        d[i][0] = a[i];
    }

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

    while (m--) {
        in >> x >> y;
        int l = y - x + 1;
        int lg = 0;
        int aux = l;
        while (aux > 1) {
            lg++;
            aux /= 2;
        }

        out << min(d[x][lg], d[x + (l - (1 << lg))][lg]) << '\n';
    }
    return 0;
}