#include <bits/stdc++.h>
#define LOG 17

using namespace std;

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

int n, x, y, q, rmq[LOG][100005], lg[100005];

int main() {
    fin >> n >> q;
    for(int i = 1; i <= n; i++) {
        fin >> rmq[0][i];
    }
    for(int i = 2; i <= n; i++) {
        lg[i] = lg[i / 2] + 1;
    }
    for(int i = 1; i <= lg[n]; i++) {
        for(int j = (1 << i); j <= n; j++) {
            rmq[i][j] = min(rmq[i - 1][j - (1 << (i - 1))], rmq[i - 1][j]);
        }
    }
    for(int i = 1; i <= q; i++) {
        fin >> x >> y;
        int l = lg[y - x + 1];
        fout << min(rmq[l][x + (1 << l) - 1], rmq[l][y]) << "\n";
    }
    return 0;
}