#include <bits/stdc++.h>
using namespace std;

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

const int maxn = 1e5 + 5;
const int maxlog = 17;
int RMQ[maxlog][maxn];

int main() {
    ios_base :: sync_with_stdio (false);
    int n, m, x, y, i, j, k;
    fin >> n >> m;
    for (i = 1; i <= n; i++) {
        fin >> RMQ[0][i];
    }
    for( i = 1; (1 << i) <= n; i++) {
        for(j = 1; j + (1 << i) - 1 <= n; j++) {
            RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + (1 << (i - 1))]);
        }
    }
    while(m--) {
        fin >> x >> y;
        k = log2(y - x);
        fout << min(RMQ[k][x], RMQ[k][y - (1 << k) + 1]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}