#define MAX_N 100000
#define MAX_LOG_N 16

#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m, a[MAX_N + 1][MAX_LOG_N + 1];

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> a[i][0];
    }

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

    for (int i = 1; i <= m; ++i) {
        int x, y;
        fin >> x >> y;
        int l = y - x + 1, r = a[x][0];
        for (int bit = 0; (1 << bit) <= l; ++bit) {
            if ((l >> bit) & 1) {
                r = min(r, a[x][bit]);
                x += 1 << bit; 
            }
        }
        fout << r << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}