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

const int LOG = 17, MAXN = 100001;

int n, q;
int rmq[MAXN][LOG];
int log_bin[MAXN];

int query(int x, int y) {
    int len = y - x + 1;
    int k = log_bin[len];
    return min(rmq[x][k], rmq[y - (1 << k) + 1][k]);
}

int main() {
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin >> n >> q;
    for (int i = 2; i <= n; ++i) {
        log_bin[i] = log_bin[i / 2] + 1;
    }
    for (int i = 1; i <= n; ++i) {
        int elem;
        cin >> elem;
        rmq[i][0] = elem;
    }
    for (int j = 1; j < LOG; ++j) {
        for (int i = 1; i <= n - (1 << j) + 1; ++i) {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
    }
    for (int i = 1; i <= q; ++i) {
        int x, y;
        cin >> x >> y;
        cout << query(x, y) << "\n";
    }
}