#include <fstream>
using namespace std;

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

#define NMAX 100005

int dp[20][NMAX];
int log2[NMAX];

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        fin >> dp[0][i];
    }

    for (int i = 1; (1 << i) <= n; ++i) {
        for (int j = 1; j + (1 << i) - 1 <= n; ++j) {
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
        }
    }

    log2[1] = 0;
    for (int i = 2; i <= n; ++i) {
        log2[i] = log2[i / 2] + 1;
    }

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

        int lung = y - x + 1;
        int log = log2[lung];

        fout << min(dp[log][x], dp[log][y - (1 << log) + 1]) << '\n';
    }
    return 0;
}