#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) begin(v), end(v)
#define al(v, l, r) begin(v) + l, begin(v) + r + 1
#define pb push_back
#define pob pop_back
#define sz(v) (int)v.size()
#define fs first
#define sd second

constexpr int inf = 2e9;
constexpr ll infll = 4e18;
constexpr int N = 1e5 + 5;
constexpr int LOG = 17;

int n, m, a[N], rmq[LOG][N];
signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        rmq[0][i] = a[i];
    }

    for (int k = 1; k < LOG; ++k) {
        int p = (1 << k), p2 = (p >> 1);
        for (int i = 1; i <= n - p2 + 1; ++i) {
            rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][i + p2]);
        }
    }

    for (int i = 0, l, r; i < m; ++i) {
        cin >> l >> r;
        int k = log(r - l + 1);
        cout << min(rmq[k][l], rmq[k][r - (1 << k) + 1]) << "\n";
    }
}