#include <fstream>

#define Lmax 18
#define Nmax 100100

using namespace std;

class RangeMinimumQuery {

    private:
        int size, Log2[Nmax], Rmq[Lmax][Nmax];

    public:
        void init(int Size) {

            size = Size;

            for(int i = 2; i <= size; i++)
                Log2[i] = Log2[size >> 1] + 1;
        }

        void process() {

            int i, j;

            for(i = 2; i <= size; i++)
                Log2[i] = Log2[i >> 1] + 1;

            for(i = 1; i <= Log2[size]; i++)
                for(j = 1; j <= size - (1 << i) + 1; j++)
                    Rmq[i][j] = min(Rmq[i - 1][j], Rmq[i - 1][j + (1 << (i-1))]);

        }

        void update(int index, int value) {
            Rmq[0][index] = value;
        }

        int query(int x, int y) {
            int l = Log2[y - x + 1];
            return min(Rmq[l][x], Rmq[l][y - (1 << l) + 1]);
        }
};

RangeMinimumQuery rmq;

int main() {

    int i, x, y, queries, N;
    ifstream in("rmq.in");
    ofstream out("rmq.out");

    in >> N >> queries;
    rmq.init(N);

    for(i = 1; i <= N; i++) {
        in >> x;
        rmq.update(i, x);
    }

    for(rmq.process(); queries--; ) {
        in >> x >> y;
        out << rmq.query(x, y) << '\n';
    }

    in.close();
    out.close();

    return 0;
}