#include <bits/stdc++.h>

using namespace std;

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

const int maxN = 1e5 + 5;

int rmq[32][maxN];
int Log[32], v[maxN];

void rmq_build(int n) {

    //rmq[i][j] = cel mai mic numar din intervalul j, j + (1 << i);
    for(int i = 1; i <= n; ++i)
        rmq[0][i] = v[i];

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

int main() {

    int n, m; fin >> n >> m;

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

    rmq_build(n);
    Log[0] = 0;
    for(int i = 2; i <= n; ++i)
        Log[i] = Log[i/2] + 1;

    for(int i = 1; i <= m; ++i) {
        int l, r; fin >> l >> r;

        int lg = Log[r-l+1];

        fout << min(rmq[lg][l], rmq[lg][r- (1 << lg) + 1]) << "\n";

    }

    return 0;
}