#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)

// https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html
template <typename Monoid>
struct PersistentSegmentTree {
  using F = function<Monoid(Monoid, Monoid)>;

  struct Node {
    Monoid data;
    Node *l, *r;

    Node(const Monoid &data) : data(data), l(nullptr), r(nullptr) {}
  };

  int sz;
  const F f;
  const Monoid M1;

  PersistentSegmentTree(const F f, const Monoid &M1) : f(f), M1(M1) {}

  Node *build(vector<Monoid> &v) {
    sz = (int)v.size();
    return build(0, (int)v.size(), v);
  }

  Node *merge(Node *l, Node *r) {
    auto t = new Node(f(l->data, r->data));
    t->l = l;
    t->r = r;
    return t;
  }

  Node *build(int l, int r, vector<Monoid> &v) {
    if (l + 1 >= r) return new Node(v[l]);
    return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));
  }

  Node *update(int a, const Monoid &x, Node *k, int l, int r) {
    if (r <= a || a + 1 <= l) {
      return k;
    } else if (a <= l && r <= a + 1) {
      return new Node(x);
    } else {
      return merge(update(a, x, k->l, l, (l + r) >> 1),
                   update(a, x, k->r, (l + r) >> 1, r));
    }
  }

  Node *update(Node *t, int k, const Monoid &x) {
    return update(k, x, t, 0, sz);
  }

  Monoid query(int a, int b, Node *k, int l, int r) {
    if (r <= a || b <= l) {
      return M1;
    } else if (a <= l && r <= b) {
      return k->data;
    } else {
      return f(query(a, b, k->l, l, (l + r) >> 1),
               query(a, b, k->r, (l + r) >> 1, r));
    }
  }

  Monoid query(Node *t, int a, int b) { return query(a, b, t, 0, sz); }
};

struct S {
  int lmax, rmax, max, sum;
  S(int a = 0) { lmax = rmax = max = sum = a; }
};
S op(S s, S t) {
  S res;
  res.lmax = max(s.lmax, s.sum + t.lmax);
  res.rmax = max(t.rmax, s.rmax + t.sum);
  res.max = max({s.max, t.max, s.rmax + t.lmax});
  res.sum = s.sum + t.sum;
  return res;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  rep(i, n) cin >> a[i], a[i]--;

  vector<pair<int, int>> p(n);
  rep(i, n) p[i] = {a[i], i};
  sort(begin(p), end(p));

  PersistentSegmentTree<S> seg(op, S(0));
  vector<S> init(n, S(1));
  vector<PersistentSegmentTree<S>::Node *> roots(n + 1);
  roots[0] = seg.build(init);
  rep(i, n) { roots[i + 1] = seg.update(roots[i], p[i].second, S(-1)); }

  rep(_, q) {
    int l, r;
    cin >> l >> r;
    l--;
    int lo = -1, hi = n + 1;
    while (hi - lo > 1) {
      int mi = (lo + hi) / 2;
      S s = seg.query(roots[mi], l, r);
      if (s.sum < 0 or s.sum - s.max + 1 < 0)
        hi = mi;
      else
        lo = mi;
    }
    cout << p[hi - 1].first + 1 << "\n";
  }
}