#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMax = 100000;

int N, M, RMQ[25][NMax+5], lg[NMax+5];

void Read() {
    in >> N >> M;
    for(int i = 1; i <= N; i++) {
        in >> RMQ[0][i];
    }
}

void LOG() {
    for (int i = 2; i <= NMax; i++)
        lg[i] = lg[i / 2] + 1;
}

void Solve() {
    int LG = lg[N];

    for (int i = 1; i <= LG; i++)
        for (int j = 1; j + (1 << i) - 1 <= N; j++)
            RMQ[i][j] = min(RMQ[i-1][j], RMQ[i-1][j+(1<<i)-1]);
}

int main() {
    Read();
    LOG();
    Solve();
    for (int i = 1, x, y; i <= M; i++) {
        in >> x >> y;
        int l = lg[abs(x-y) - 1];
        out << min(RMQ[l][x], RMQ[l][y - (1 << l) + 1]) << '\n';
    }
}