#define MAX_N 100000
#define MAX_LOG_N 16

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

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

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

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

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