#include <iostream>
#include <fstream>

#define MAX_SIZE 100000

int main() {
    std::ifstream input("rmq.in");
    std::ofstream output("rmq.out");

    int n, m, a[MAX_SIZE] = {0};

    input >> n >> m;

    for (int i = 0; i < n; ++i) input >> a[i];

    int sections[MAX_SIZE] = {0};

    int q = 1;

    for (int i = 0; i * i <= n; ++i) {
        sections[i] = i;
        for (int j = 1; j * j < n; ++j) {
            if (a[i + j] < a[sections[i]]) sections[i] = i + j;
        }
        q = i;
    }


    while (m--) {
        int x, y;
        input >> x >> y;
        x--, y--;

        int start = x / q;
        int finish = y / q;
        int min = INT32_MAX;
        for (int i = start + 1; i <= finish - 1; ++i) {
            min = std::min(min, a[sections[i]]);
        }

        for (int i = x; i < ((start + 1) * q - 1) && i < n; ++i) {
            min = std::min(min, a[i]);
        }

        for (int i = finish * q; i <= y; ++i) {
            min = std::min(min, a[i]);
        }
        output << min << '\n';
    }

    return 0;
}