#ifndef hwe
#include "jumps.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T1, class T2> T1 random(T1 l, T2 r) {
return uniform_int_distribution<T1>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
int n;
int le[N], ri[N], dp[N];
vector<int> adj[N];
void init(int _n, vector<int> h) {
n = _n;
stack<int> st;
for (int i = 0; i < n; ++i) {
while (!st.empty() && h[st.top()] < h[i]) st.pop();
le[i] = (st.empty() ? -1 : st.top());
st.emplace(i);
}
while (!st.empty()) st.pop();
for (int i = n - 1; i >= 0; --i) {
while (!st.empty() && h[st.top()] < h[i]) st.pop();
ri[i] = (st.empty() ? n : st.top());
st.emplace(i);
}
for (int i = 0; i < n; ++i) {
adj[i].clear();
if (le[i] != -1) adj[i].emplace_back(le[i]);
if (ri[i] != n) adj[i].emplace_back(ri[i]);
}
}
void dfs(int u) {
if (dp[u] != -1) return;
dp[u] = inf;
for (auto v : adj[u]) {
dfs(v);
minimize(dp[u], 1 + dp[v]);
}
}
int minimum_jumps(int a, int b, int c, int d) {
for (int i = 0; i < n; ++i) dp[i] = -1;
for (int i = c; i <= d; ++i) dp[i] = 0;
for (int i = a; i <= b; ++i) dfs(i);
int ans = *min_element(dp + a, dp + b + 1);
return (ans == inf ? -1 : ans);
}
#ifdef hwe
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n, q; cin >> n >> q;
vector<int> h(n);
for (auto &x : h) cin >> x;
init(n, h);
for (int _ = 0; _ < q; ++_) {
int a, b, c, d; cin >> a >> b >> c >> d;
cerr << minimum_jumps(a, b, c, d) << '\n';
}
return 0;
}
#endif
