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

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

const int N = 100000;
const int LOG = 18;

int tab[LOG][N], lg[N], a[N];

int main() {
    int n, m;

    fin >> n >> m;

    for (int i = 1; i <= n; i++)
        fin >> a[i];

    lg[1] = 0;

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

    for (int i = 1; i <= n; i++)
        tab[0][i] = a[i];

    for (int i = 1; (1 << i) <= n; i++) {
        for (int j = 1; j <= n - (1 << i) + 1; j++) {
            int l = 1 << (i - 1);

            tab[i][j] = min(tab[i - 1][j], tab[i - 1][j + l]);
        }
    }

    int i = 1;

    while (i <= m) {
        int x, y;

        fin >> x >> y;

        int d = y - x + 1;
        int l = lg[d];
        int q = d - (1 << l);

        fout << min(tab[l][x], tab[l][x + q]) << '\n';

        i++;
    }

    return 0;
}