#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;
using ll = long long;
using ld = long double;

#define all(x)  x.begin(),x.end()
#define v(x) vector<x>
#define nl '\n'
#define fxd(x) fixed << setprecision(x)
template<class t> using ordered_set = tree<t, null_type, less<t>, rb_tree_tag, tree_order_statistics_node_update>;
template<class t> using ordered_multiset = tree<t, null_type, less_equal<t>, rb_tree_tag, tree_order_statistics_node_update>;


int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    ll n , k ; cin >> n >> k;
    v(ll) arr(n); for (int i = 0; i < n; i++) cin >> arr[i];
    
    multiset<ll> mst; ll cnt = 0 , l = 0;
    for (int r = 0; r < n; r++)
    {
        mst.insert(arr[r]);
        while (*(--mst.end()) - *mst.begin() > k)
        {
            mst.erase(mst.find(arr[l++]));
        }
        cnt += mst.size();
    }
    cout << cnt;
}