//#define NDEBUG
#pragma warning(disable : 4146)

#include <algorithm>
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <iomanip>
#include <ios>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;
  using f64 = double;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';

  i64 floor_div(const i64 n, const i64 d) {
    assert(d != 0);
    return n / d - static_cast<i64>((n ^ d) < 0 && n % d != 0);
  }

  i64 ceil_div(const i64 n, const i64 d) {
    assert(d != 0);
    return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0);
  }

#ifdef N91_LOCAL
#define OJ_LOCAL(a, b) b
#else
#define OJ_LOCAL(a, b) a
#endif

} // namespace n91

#include <atcoder/segtree>

#include<numeric>

namespace n91 {

  struct S {
    isize sum, l, r, max;
    S(isize x) : sum(x), l(std::max<isize>(0, x)), r(l), max(l) {}
    S(isize s_, isize l_, isize r_, isize m_) : sum(s_), l(l_), r(r_), max(m_) {}
  };

  S op(S x, S y) {
    return S(x.sum + y.sum, std::max(x.l, x.sum + y.l),
      std::max(x.r + y.sum, y.r), std::max({ x.max, y.max, x.r + y.l }));
  }

  S id() { return S(0, 0, 0, 0); }

  void main_() {
    const usize n = scan<usize>();
    const usize q = scan<usize>();
    std::vector<usize> a(n);
    for (auto& e : a) {
      std::cin >> e;
    }
    struct query_t {
      usize l, r;
      usize ng, ok;

      usize mid() const { return (ng + ok) / 2; }
    };
    std::vector<query_t> qs(q);
    for (auto& [l, r, ng, ok] : qs) {
      std::cin >> l >> r;
      l--;
      ng = 0;
      ok = n;
    }

    atcoder::segtree<S, op, id> seg_(n);
    for (const usize i : rep(0, n)) {
      seg_.set(i, S(1));
    }

    std::vector<usize> idx(n);
    std::iota(idx.begin(), idx.end(), 0);
    std::sort(idx.begin(), idx.end(),
      [&](usize x, usize y) { return a[x] < a[y]; });
    while (true) {
      std::vector<query_t*> lst;
      for (auto& e : qs) {
        if (e.ok - e.ng >= 2) {
          lst.push_back(&e);
        }
      }
      if (lst.empty()) {
        break;
      }
      std::sort(lst.begin(), lst.end(),
        [](const auto x, const auto y) { return x->mid() < y->mid(); });

      auto seg = seg_;
      auto itr = idx.begin();
      for (const auto e : lst) {
        const usize mid = e->mid();
        while (itr != idx.end() && a[*itr] <= mid) {
          seg.set(*itr, S(-1));
          itr++;
        }
        const auto v = seg.prod(e->l, e->r);
        if (v.sum < 0 || v.sum - v.max + 1 < 0) {
          e->ok = mid;
        }
        else {
          e->ng = mid;
        }
      }
    }

    for (const auto& e : qs) {
      std::cout << e.ok << eoln;
    }
  }

} // namespace n91

int main() {
  //*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  std::cout << std::fixed << std::setprecision(20);
  n91::main_();
  return 0;
}