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

#define int long long
#define maxn 100005
struct segmentTree {
    int l, r;
    int dat;
} t[maxn * 4];
int n, m;
int a[maxn];

void build(int p, int l, int r) {
    t[p].l = l, t[p].r = r;
    if (l == r) { t[p].dat = a[l]; return; }
    int mid = (l + r) >> 1;
    build(p << 1, l, mid), build((p << 1) | 1, mid + 1, r);
    t[p].dat = min(t[p << 1].dat, t[(p << 1) | 1].dat);
}

int ask(int p, int l, int r) {
    if (t[p].l == t[p].r) return t[p].dat;
    int mid = (t[p].l + t[p].r) >> 1, val = 1e16;
    if (l <= mid) val = min(val, ask(p << 1, l, r));
    if (r > mid) val = min(val, ask((p << 1) | 1, l, r));
    return val;
}

signed main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    build(1, 1, n);
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        cout << ask(1, x, y) << " ";
    }
    return 0;
}

话说我最近线段树的题目时间复杂度都好大啊