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

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

const int Nmax = 1e5 + 10;
const int Lmax = 18;

int n, m, sparse[Nmax][Lmax], input[Nmax];

void getSparse() {
    for(int i = 0; i < n; ++i) {
        sparse[i][0] = i;
    }

    for(int j = 1; (1 << j) <= n; ++j) {
        for(int i = 0; i + (1 << j) - 1 < n; ++i) {
            if(input[sparse[i][j - 1]] < input[sparse[i + (1 << (j - 1))][j - 1]]) {
                sparse[i][j] = sparse[i][j - 1];
            } else {
                sparse[i][j] = sparse[i + (1 << (j - 1))][j - 1];
            }
        }
    }
}

int RMQ(int lo, int hi) {
    int len = hi - lo + 1;
    int k = log2(len);

    return min(input[sparse[lo][k]], input[sparse[lo + len - (1 << k)][k]]);
}

int main() {
    ios::sync_with_stdio(false); in.tie(0); out.tie(0);

    in >> n >> m;
    for(int i = 0; i < n; ++i) {
        in >> input[i];
    }

    getSparse();

    for(int i = 1; i <= m; ++i) {
        int a, b; in >> a >> b;
        out << RMQ(a - 1, b - 1) << "\n";
    }
 
    in.close(); out.close();
 
    return 0;
}