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

int m[100005][33];
int LOG = 17;

int query(int l, int r) {
    int len = r - l + 1;
    int k = 0;
    while((1 << (k+1)) <= len) {
        k++;
    }
    return min(m[l][k], m[r-(1<<k)+1][k]);
}

int main() {
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    int n, q;
    cin >> n >> q;
    for(int i = 0; i < n; i++) {
        cin >> m[i][0];
    }
    for(int k = 1; k < LOG; k++) {
        for(int i = 0; i + (1<<k) - 1 < n; i++) {
            m[i][k] = min(m[i][k-1], m[i+(1<<(k-1))][k-1]);
        }
    }
    while(q--) {
        int l, r;
        cin >> l >> r;
        l--;
        r--;
        cout << query(l, r) << '\n';
    }
}