/* Problem URL: https://codeforces.com/edu/course/2/lesson/9/2/practice/contest/307093/problem/F */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

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

    int n;
    ll k;
    cin >> n >> k;

    vl a(n);
    cin >> a;

    vvl minsparse(20, vl(n));
    vvl maxsparse(20, vl(n));

    rep(i, n) {
        minsparse[0][i] = a[i];
        maxsparse[0][i] = a[i];
    }

    nrep(j, 1, 20) {
        for (int i = 0; i + (1 << (j - 1)) < n; i++) {
            minsparse[j][i] = min(minsparse[j - 1][i], minsparse[j - 1][i + (1 << (j - 1))]);
            maxsparse[j][i] = max(maxsparse[j - 1][i], maxsparse[j - 1][i + (1 << (j - 1))]);
        }
    }

    auto querymin = [&](int l, int r) {
        int log = 31 - __builtin_clz(r - l + 1);
        return min(minsparse[log][l], minsparse[log][r - (1 << log) + 1]);
    };

    auto querymax = [&](int l, int r) {
        int log = 31 - __builtin_clz(r - l + 1);
        return max(maxsparse[log][l], maxsparse[log][r - (1 << log) + 1]);
    };

    ll ans = 0;

    int j = 0;
    rep(i, n) {
        while (querymax(j, i) - querymin(j, i) > k) {
            j++;
        }

        ans += i - j + 1;
    }

    cout << ans << '\n';
}