#include <fstream>
#include <algorithm>
using namespace std;

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

const int MAXN = 100005;
const int MAXL = 25;
int n, m;
int l[MAXL];
int v[MAXN];
int rmq[MAXL][MAXN];

int main() {

    fin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        fin >> v[i];
        rmq[0][i] = v[i];
    }

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


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

    for (int i = 1; i <= m; ++i) {
        int x, y;
        fin >> x >> y;
        int k = y - x + 1;
        int f = l[k];
        int q = k - (1 << f);
        fout << min(rmq[f][x], rmq[f][x + q]) << '\n';
    }

    fout.close();
    return 0;
}