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

using ll = long long;

const int N = 1e5+5;

int n;
ll K, a[N], M[N];
int b[N];
vector<ll> vals;
int m, bit[N];
ll ans = 0;

void update(int p, int v) {
    for (; p <= m; p += p & -p) bit[p] += v;
}

int query(ll p) {
    int sum = 0;
    for (; p > 0; p -= p & -p) sum += bit[p];
    return sum;
}

void DNC(int l, int r) {
    if (l == r) { 
        if (a[l] <= K) ans++;
        return;
    }
    int mid = (l + r) >> 1;
    DNC(l, mid);
    DNC(mid + 1, r);
    M[mid] = a[mid];
    for (int i = mid - 1; i >= l; i--) M[i] = min(M[i + 1], a[i]);
    for (int j = mid + 1; j <= r; j++) M[j] = min(M[j - 1], a[j]);
    int j = mid + 1;
    for (int i = mid; i >= l; i--) {
        while (j <= r && M[j] >= M[i]) {
            update(b[j], 1);
            j++;
        }
        ll Q = a[i] + M[i] - K;
        int idx = lower_bound(vals.begin(), vals.end(), Q) - vals.begin();
        ans += (j - mid - 1) - query(idx);
    }
    for (int k = mid + 1; k < j; k++) update(b[k], -1);
    int i = mid;
    for (int j = mid + 1; j <= r; j++) {
        while (i >= l && M[i] > M[j]) {
            update(b[i], 1);
            i--;
        }
        ll Q = a[j] - M[j] + K;
        int idx = upper_bound(vals.begin(), vals.end(), Q) - vals.begin();
        ans += query(idx);
    }
    for (int k = mid; k > i; k--) update(b[k], -1);
}

void solve() {
    cin >> n >> K;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        vals.push_back(a[i]);
    }
    sort(vals.begin(), vals.end());
    vals.erase(unique(vals.begin(), vals.end()), vals.end());
    m = vals.size();
    for (int i = 1; i <= n; i++) b[i] = lower_bound(vals.begin(), vals.end(), a[i]) - vals.begin() + 1;
    DNC(1, n);
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    #define TASK "INTERVAL"
    if (fopen(TASK".INP", "r")) {
        freopen(TASK".INP", "r", stdin);
        freopen(TASK".OUT", "w", stdout);
    }

    int tests = 1; // cin >> tests;
    while (tests--) solve();

    #ifdef LOCAL
    cerr << "\nTime elapsed: " << clock() << " ms.\n";
    #endif

    return 0;
}