#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define met(a, b) memset(a, b, sizeof(a))
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define bep(i, a, b) for(int i = a; i >= b; i--)
#define lowbit(x) (x&(-x))
#define MID (l + r) / 2
#define ls pos*2
#define rs pos*2+1
#define pb push_back
#define ios() ios::sync_with_stdio(0)

using namespace std;

const int maxn = 1e6 + 1010;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 123456789;

int L[maxn], R[maxn];
int arr[maxn], st[maxn][21];
int depst[maxn][21];
int n, m;
int deep[maxn];

int st_query(int l, int r) {
    int k = log2(r - l + 1);
    if(arr[st[l][k]] >= arr[st[r - (1 << k) + 1][k]]) return st[l][k];
    else return st[r - (1 << k) + 1][k];
}
int depst_query(int l, int r) {
    int k = log2(r - l + 1);
    return max(depst[l][k], depst[r - (1 << k) + 1][k]);
}
void dfs(int l, int r, int dep) {
    // cout << l << ‘ ‘ << r << endl; int a; cin >> a;
    if(l > r) return;
    int now = st_query(l, r); 
    deep[now] = dep;
    if(l == r) return;
    dfs(l, now - 1, dep + 1);
    l = now;
    while(l < r && arr[st_query(l + 1, r)] == arr[now]) {
        int t = st_query(l + 1, r);
        // cout << l << ‘ ‘ << t << endl; int a; cin >> a;
        deep[t] = dep;
        dfs(l + 1, t - 1, dep + 1);
        l = t;
    }
    dfs(l + 1, r, dep + 1);
}

int main() {
    cin >> n >> m;
    rep(i, 1, n) {
        cin >> arr[i];
        st[i][0] = i;
    }
    rep(j, 1, 20) {
        int i = 1;
        while(i + (1 << j) - 1 <= n) {
            if(arr[st[i][j-1]] >= arr[st[i + (1 << (j-1))][j-1]]) st[i][j] = st[i][j-1];
            else st[i][j] = st[i + (1 << (j-1))][j-1];
            i++;
        }
    }
    L[0] = 0;
    rep(i, 1, n) {
        int t = i - 1;
        while(t && arr[t] < arr[i]) t = L[t];
        L[i] = t;   
    }
    R[n+1] = n+1;
    bep(i, n, 1) {
        int t = i + 1;
        while(t <= n && arr[t] < arr[i]) t = R[t];
        R[i] = t;
    }
    dfs(1, n, 1);
    rep(i, 1, n) depst[i][0] = deep[i];

    rep(j, 1, 20) {
        int i = 1;
        while(i + (1 << j) - 1 <= n) {
            depst[i][j] = max(depst[i][j-1], depst[i + (1 << (j-1))][j-1]);
            i++;
        }
    }
    rep(i, 1, m) {
        int l, r;
        cin >> l >> r;
        if(r == 0) cout << depst_query(L[l] + 1, R[l] - 1) - deep[l] << endl;
        else {
            if(l > r) swap(l, r);
            if(l == r || (r - l == 1 && arr[l] == arr[r])) {
                cout << 0 << endl;
                continue;
            }
            if(r - l > 1 && arr[st_query(l + 1, r - 1)] >= max(arr[l], arr[r])) {
                cout << 0 << endl;
                continue;
            }
            cout << abs(deep[l] - deep[r]) << endl;
        }
    }
    return 0;
}